Solving NP-hard problems in 'almost trees': Vertex cover

Citations of this article
Mendeley users who have this article in their library.


We present an algorithm which finds a minimum vertex cover in a graph G(V, E) in time O(|V|+( a k)2k 3), where for connected graphs G the parameter a is defined as the minimum number of edges that must be added to a tree to produce G, and k is the maximum a over all biconnected components of the graph. The algorithm combines two main approaches for coping with NP-completeness, and thereby achieves better running time than algorithms using only one of these approaches. © 1985.




Coppersmith, D., & Vishkin, U. (1985). Solving NP-hard problems in “almost trees”: Vertex cover. Discrete Applied Mathematics, 10(1), 27–45.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free