An O*(1.0977n) Exact Algorithm for max independent setin Sparse Graphs

Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos. An O*(1.0977n) Exact Algorithm for max independent setin Sparse Graphs. In Martin Grohe, Rolf Niedermeier, editors, Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings. Volume 5018 of Lecture Notes in Computer Science, pages 55-65, Springer, 2008. [doi]

Abstract

Abstract is missing.