Fast algorithms for max independent set

Algorithmica (New York)

Volumn 62, Issue 1-2, 2012, Pages 382-415

  Bourgeois, Nicolas ^a   Escoffier, Bruno ^a   Paschos, Vangelis T ^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

AVERAGE DEGREE; BOTTOM UP METHODS; EXACT ALGORITHMS; FAST ALGORITHMS; GENERAL GRAPH; MAX INDEPENDENT SET; MAX INDEPENDENT SETS; MAXIMUM DEGREE; NON-TRIVIAL; POLYNOMIAL SPACE; RUNNING TIME; SET COVER PROBLEM; WORST-CASE COMPLEXITY;

ALGORITHMS;

GRAPHIC METHODS;

EID: 84855353342     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-010-9460-7     Document Type: Article

References (21)

1. Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: Proc. Symposium on Discrete Algorithms, SODA'99, pp. 856-857 (1999)
2. n ) exact algorithm for max independent set in sparse graphs. In: Grohe, M., Niedermeier, R. (eds.) Proc. International Workshop on Exact and Parameterized Computation, IWPEC'08. Lecture Notes in Computer Science, vol. 5018, pp. 55-65. Springer, Berlin (2008)
3. n ). In: Kratochvíl, J., Li, A., Fiala, J., Kolman, P. (eds.) Proc. Conference on Theory and Applications of Models of Computation, TAMC'10. Lecture Notes in Computer Science, vol. 6108, pp. 373-384. Springer, Berlin (2010)
4. J. Chen L. Liu W. Jia 2000 Improvement on vertex cover for low-degree graphs Networks 35 4 253 259
5. J. Chen I.A. Kanj G. Xia 2005 Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems Algorithmica 43 4 245 273 (Pubitemid 43018036)
6. V. Dahllöf P. Jonsson M. Wahlström 2005 Counting models for 2SAT and 3SAT formulæ Theor. Comput. Sci. 332 1-3 265 291 (Pubitemid 40226796)
7. F.V. Fomin K. Høie 2006 Pathwidth of cubic graphs and exact algorithms Inf. Process. Lett. 97 5 191 196 (Pubitemid 43060082)
8. F.V. Fomin S. Gaspers S. Saurabh A.A. Stepanov 2009 On two techniques of combining branching and treewidth Algorithmica 54 2 181 207
9. F.V. Fomin F. Grandoni D. Kratsch 2009 A measure & conquer approach for the analysis of exact algorithms J. Assoc. Comput. Mach. 56 5 1 32
10. Fürer, M.: A faster algorithm for finding maximum independent sets in sparse graphs. In: Corea, J.R., Hevia, A., Kiwi, M. (eds.) Proc. Latin American Symposium on Theoretical Informatics, LATIN'06. Lecture Notes in Computer Science, vol. 3887, pp. 491-501. Springer, Berlin (2006)
11. Fürer, M., Kasiviswanathan, S.P.: Algorithms for counting 2-SAT solutions and colorings with applications. In: Kao, M.-Y., Li, X.-Y. (eds.) Proc. Algorithmic Aspects in Information and Management, AAIM'07. Lecture Notes in Computer Science, vol. 4508, pp. 47-57. Springer, Berlin (2007)
12. Goldberg, M.K., Spencer, T.H., Berque, D.A.: A low-exponential algorithm for counting vertex covers. In: Graph Theory, Combinatorics and Algorithms. Proc. 7th Quadrennial International Conference on the Theory and Application of Graphs, vol. 1, pp. 431-444. Wiley, New York (1992)
13. Kneis, J., Langer, A., Rossmanith, P.: A fine-grained analysis of a simple independent set algorithm. In: Kannan, R., Narayan Kumar, K. (eds.) Proc. Foundations of Software Technology and Theoretical Computer Science, FSTTCS'09. LIPIcs, vol. 4, pp. 287-298. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2009)
14. Kojevnikov, A., Kulikov, A.S.: A new approach to proving upper bounds for max-2-sat. In: Proc. Symposium on Discrete Algorithms, SODA'06, pp. 11-17 (2006)
15. I. Razgon 2009 Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 J. Discrete Algorithms 7 191 212
16. J.M. Robson 1986 Algorithms for maximum independent sets J. Algorithms 7 3 425 440
17. n/4). Technical Report 1251-01, LaBRI, Université de Bordeaux I (2001)
18. van Rooij, J.M.M., Bodlaender, H.L.: Design by measure and conquer, a faster exact algorithm for dominating set. In: Albers, S., Weil, P. (eds.) Proc. International Symposium on Theoretical Aspects of Computer Science, STACS'08, pp. 657-668. Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany (2008)
19. Wahlström, M.: A tighter bound for counting max-weight solutions to 2sat instances. In: Grohe, M., Niedermeier, R. (eds.) Proc. Parameterized and Exact Computation, Third International Workshop, IWPEC'08. Lecture Notes in Computer Science, vol. 5018, pp. 202-213. Springer, Berlin (2008)
20. Woeginger, G.J.: Exact algorithms for NP-hard problems: a survey. In: Juenger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization-Eureka! You shrink! Lecture Notes in Computer Science, vol. 2570, pp. 185-207. Springer, Berlin (2003)
21. Xiao, M.: New branching rules: improvements on independent set and vertex cover in sparse graphs. CoRR (2009). ArXiv:0904.2712