Worst-case time bounds for coloring and satisfiability problems

Journal of Algorithms

Volumn 45, Issue 2, 2002, Pages 192-201

  Feder, Tomás ^a   Motwani, Rajeev ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; PROBLEM SOLVING; RANDOM PROCESSES;

DISCRETE ALGORITHMS;

COMPUTATIONAL COMPLEXITY;

EID: 0037235029     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(02)00224-9     Document Type: Article

References (21)

1. E.T. Bax, Inclusion and exclusion algorithm for the Hamiltonian path problem, Inform. Process. Lett. 47 (1993) 203-207.
2. n): a no-MIS algorithm, in: Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, 1995, pp. 444-453.
3. D. Eppstein, Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction, in: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 329-337.
4. Y. Gurevich, S. Shelah, Expected computation time for the Hamiltonian path problem, SIAM J. Comput. 16 (1987) 486-502.
5. M. Held, R.M. Karp, A dynamic programming approach to sequencing problems, J. Soc. Indust. Appl. Math. 10 (1962) 196-210.
6. 0.304n algorithm for solving maximum independent set problem, IEEE Trans. Comput. C 35 (1986) 847-851.
7. D. Johnson, M. Yannakakis, C.H. Papadimitriou, On generating all maximal independent sets, Inform. Process. Lett. 27 (1988) 119-123.
8. O. Kullman, Worst-case analysis, 3-SAT decision and lower bounds: Approaches to improved SAT algorithms, in: Proceedings of the DIMACS Workshop on Satisfiability Problem, 1996.
9. E.L. Lawler, A note on the complexity of the chromatic number problem, Inform. Process. Lett. 5 (1976) 66-67.
10. n steps, Discrete Appl. Math. 10 (1985) 287-295.
11. J.W. Moon, L. Moser, On cliques in graphs, Israel J. Math. 3 (1965) 23-28.
12. R. Paturi, P. Pudlák, F. Zane, Satisfiability coding lemma, in: Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, 1997.
13. R. Paturi, P. Pudlák, M.E. Saks, F. Zane, An improved exponential-time algorithm for k-SAT, in: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, 1998, pp. 628-637.
14. J.M. Robson, Algorithms for maximum independent sets, J. Algorithms 7 (1986) 425-449.
15. M. Shindo, E. Tomita, A simple algorithm for finding a maximum clique and its worst-case time complexity, Systems Comput. Japan 12 (1990) 1-13.
16. n steps, in: Selected Papers from Workshop on Computer Science Logic, in: Lecture Notes in Comput. Sci., Vol. 702, Springer-Verlag, 1993, pp. 379-394.
17. n) steps, in: Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science, 1994, pp. 177-182.
18. I. Schiermeyer, Pure literal look ahead: An O (1.497) 3-satisfiability algorithm, in: Proceedings of the Workshop on the Satisfiability Problem, Siena, 1996.
19. U. Schöning, A probabilistic algorithm for k-SAT and constraint satisfaction problems, in: Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, 1999, pp. 410-414.
20. R.E. Tarjan, A.E. Trojanowski, Finding a maximum independent set, SIAM J. Comput. 6 (1977) 537-546.
21. W. Zhang, Number of models and satisfiability of sets of clauses, Theoret. Comput. Sci. 155 (1996) 277-288.