Abstract
We show that the k-Vertex Cover problem in degree-3 graphs can be solved in O *(1.1616 k ) time, which improves previous results of O *(1.1940 k ) by Chen, Kanj and Xia and O *(1.1864 k ) by Razgon. In this paper, we will present a new way to analyze algorithms for the problem. We use to measure the size of the search tree, and then get a simple -time algorithm, where n 0 is the number of vertices with degree > 2 in the graph. Combining this result with fast algorithms for the Maximum Independent Set problem in degree-3 graphs, we improve the upper bound for the k-Vertex Cover problem in degree-3 graphs. © 2010 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Xiao, M. (2010). A note on vertex cover in graphs with maximum degree 3. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6196 LNCS, pp. 150–159). https://doi.org/10.1007/978-3-642-14031-0_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
