A fine-grained analysis of a simple independent set algorithm?

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 4, Issue , 2009, Pages 287-298

  Kneis, Joachim ^a   Langer, Alexander ^a   Rossmanith, Peter ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCHING RULES; CASE ANALYSIS; COMPUTER-AIDED; EXACT ALGORITHMS; FINE-GRAINED ANALYSIS; INDEPENDENT SET; INDEPENDENT SET PROBLEMS; SIMPLE ALGORITHM;

COMPUTER AIDED ANALYSIS; SOFTWARE ENGINEERING;

ALGORITHMS;

EID: 84880197077     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.FSTTCS.2009.2326     Document Type: Conference Paper

References (19)

1. K. Appel and W. Haken. Solution of the four color map problem. Scientific American, 237: 108-121, 1977.
2. K. Appel, W. Haken, and J. Koch. Every planar map is four colorable. Journal of Mathematics, 21: 439-567, 1977.
3. M. Blum and S. Kannan. Designing programs that check their work. J. ACM, 42(1): 269-291, 1995.
4. J. Chen, I. Kanj, and W. Jia. Vertex cover: Further observations and further improvements. In Proc. of 25th WG, number 1665 in LNCS, pages 313-324. Springer, 1999.
5. 0.288n) independent set algorithm. In Proc. of 17th SODA, pages 18-25, 2006.
6. F. V. Fomin, F. Grandoni, and D. Kratsch. Measure and conquer: Domination - A case study. In Proc. of 32nd ICALP, LNCS, pages 191-203. Springer, 2005.
7. M. Fürer. A faster algorithm for finding maximum independent sets in sparse graphs. In Proc. of 7th LATIN, number 3887 in LNCS, pages 491-501. Springer, 2006.
8. 0.304n) algorithm for solving Maximum Independent Set problem. IEEE Transactions on Computers, 35(9): 847-851, 1986.
9. J. Kneis and A. Langer. Satellites and mirrors for solving independent set on sparse graphs. Technical Report AIB-2009-08, RWTH Aachen University, April 2009.
10. J. Kneis, A. Langer, and P. Rossmanith. Independent set proof homepage, 2009. http://www.tcs.rwth-aachen.de/independentset/.
11. A. Kojevnikov and A. S. Kulikov. A new approach to proving upper bounds for MAX-2-SAT. In Proc. of 17th SODA, pages 11-17, 2006.
12. D. Kratsch, R. M. McConnell, K. Mehlhorn, and J. Spinrad. Certifying algorithms for recognizing interval graphs and permutation graphs. SIAM J. Comput., 36(2): 326-353, 2006.
13. M. Nett. Generating all relevant cases for the maximum independent set problem. Technical Report AIB-2009-09, RWTH Aachen University, 2009.
14. I. Razgon. Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3. J. Discrete Algorithms, 7(2): 191-212, 2009.
15. F. Reidl and F. Sánchez Villaamil. Automatic verification of the correctness of the upper bound of a maximum independent set algorithm. Technical Report AIB-2009-10, RWTH Aachen University, 2009.
16. J. M. Robson. Personal communication.
17. J. M. Robson. Algorithms for maximum independent sets. J. Algorithms, 7: 425-440, 1986.
18. n/4). Technical Report 1251-01, Université Bordeaux I, LaBRI, 2001.
19. R. E. Tarjan and A. E. Trojanowski. Finding a Maximum Independent Set. SIAM Journal on Computing, 6(3): 537-550, 1977.