A bottom-up method and fast algorithms for max independent set

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

Volumn 6139 LNCS, Issue , 2010, Pages 62-73

  Bourgeois, Nicolas ^a   Escoffier, Bruno ^a   Paschos, Vangelis Th ^a   Van Rooij, Johan M M ^b  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Bottom Up Method; Exact Algorithms; Max Independent Set

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BOTTOM UP METHODS; EXACT ALGORITHMS; FAST ALGORITHMS; MAX INDEPENDENT SETS; MEASURE AND CONQUER; POLYNOMIAL SPACE; SET COVER PROBLEM; WORST-CASE COMPLEXITY;

GRAPHIC METHODS;

EID: 77954628889     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13731-0_7     Document Type: Conference Paper

References (10)

1. Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: Proc. SODA'99, pp. 856-857 (1999)
2. n) exact algorithm for max independent set in sparse graphs. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 55-65. Springer, Heidelberg (2008)
3. Bourgeois, N., Escoffier, B., Paschos, V.T., van Rooij, J.M.M.: Fast Algorithms for Max Independent Set in Graphs of Small Average Degree. CoRR, abs/0901.1563 (2009)
4. Fomin, F.V., Grandoni, F., Kratsch, D.: A measure and conquer approach for the analysis of exact algorithms. Journal of the ACM 56(5) (2009)
5. Kneis, J., Langer, A., Rossmanith, P.: A Fine-grained Analysis of a Simple Independent Set Algorithm. In: Proc. FSTTCS 2009, pp. 287-298 (2009)
6. Razgon, I.: Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3. J. Discrete Algorithms 7, 191-212 (2009)
7. Robson, J.M.: Algorithms for maximum independent sets. J. Algorithms 7(3), 425-440 (1986)
8. n/4). Technical Report 1251-01, LaBRI, Université de Bordeaux I (2001)
9. Van Rooij, J.M.M., Bodlaender, H.L.: Design by measure and conquer a faster algorithm for dominating set. In: STACS 2008, pp. 657-668 (2008)
10. Woeginger, 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)