Abstract
We show that the maximum independent set problem (MIS) on an n-vertex graph can be solved in 1.2002n n O(1) time and polynomial space, which is even faster than Robson's 1.2109n n O(1)-time exponential-space algorithm published in 1986. We also obtain improved algorithms for MIS in graphs with maximum degree 6 and 7. Our algorithms are obtained by effectively using fast algorithms for MIS in low-degree graphs and making careful analyses for MIS in high-degree graphs. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Xiao, M., & Nagamochi, H. (2013). Exact algorithms for maximum independent set. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8283 LNCS, pp. 328–338). https://doi.org/10.1007/978-3-642-45030-3_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
