A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs

Martin Fürer. A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs. In José R. Correa, Alejandro Hevia, Marcos A. Kiwi, editors, LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings. Volume 3887 of Lecture Notes in Computer Science, pages 491-501, Springer, 2006. [doi]

Abstract

Abstract is missing.