An O*(1.0977n ) exact algorithm for max independent set in sparse graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5018 LNCS, Issue , 2008, Pages 55-65

  Bourgeois, Nicolas ^a   Escoffier, Bruno ^a   Paschos, Vangelis Th ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; SET THEORY;

MAX INDEPENDENT SET; SEARCH-TREE;

ALGORITHMS;

EID: 44649145363     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79723-4_7     Document Type: Conference Paper

References (8)

1. n/4). Technical Report 1251-01, LaBRI, Université de Bordeaux I (2001)
2. Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: Proc. Symposium on Discrete Algorithms, SODA 1999, pp. 856-857 (1999)
3. Chen, J., Kanj, I.A., Xia, G.: Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 148-157. Springer, Heidelberg (2003)
4. Fomin, F.V., Høie, K.: Pathwidth of cubic graphs and exact algorithms. Inform. Process. Lett. 97, 191-196 (2006)
5. Fürer, M.: A faster algorithm for finding maximum independent sets in sparse graphs. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 491-501. Springer, Heidelberg (2006)
6. Razgon, I.: A faster solving of the maximum independent set problem for graphs with maximal degree 3. In: Proc. Algorithms and Complexity in Durham, ACiD 2006, pp. 131-142 (2006)
7. Wœginger, G.J.: Exact algorithms for NP-hard problems: A survey. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol. 2570, pp. 185-207. Springer, Heidelberg (2003)
8. Eppstein, D.: Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. In: Proc. Symposium on Discrete Algorithms, SODA 2001, pp. 329-337 (2001)