Abstract
We present an O*(1.0977n ) search-tree based exact algorithm for max independent set in graphs with maximum degree 3. It can be easily seen that this algorithm also works in graphs with average degree 3. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
APA
Bourgeois, N., Escoffier, B., & Paschos, V. T. (2008). An O*(1.0977n ) exact algorithm for max independent set in sparse graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5018 LNCS, pp. 55–65). Springer Verlag. https://doi.org/10.1007/978-3-540-79723-4_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free