What are the current best known exact algorithms for finding a minimum vertex cover? Is min vertex cover NP-complete or not? I've found a lot of conflicting information online.