Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 329-337

  Eppstein, David ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Algorithms; Measurement; Performance; Theory; Verification

Indexed keywords

EID: 33746393832     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Noga Alon, Nabil Kahale, A Spectral Technique for Coloring Random 3-Colorable Graphs, SIAM Journal on Computing, v.26 n.6, p.1733-1748, Dec. 1997 [doi〉10.1137/S0097539794270248]
2. R. Beigel, D. Eppstein, 3-coloring in time 0(1.3446n): a no-MIS algorithm, Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95), p.444, October 23-25, 1995
3. R. Beigel and D. Eppstein. 3-coloring in time (.9(1.3289n). ACM Computing Research Repository, June 2000. cs.DS/0006046.
4. Avrim Blum, David Karger, An Õ(n3/14)-coloring algorithm for 3-colorable graphs, Information Processing Letters, v.61 n.1, p.49-53, Jan. 14, 1997 [doi〉10.1016/S0020-0190(96)00190-1]
5. E. Dantsin. Two systems for proving tautologies, based on the split method, J. Soy. Math. 22:1293-1305, 1983. Original Russian article appeared in 1981.
6. E. Dantsin and E. A. Hirsch. Algorithms for k-SAT based on covenng codes. Prepfint 1/2000, Steklov Inst. of Mathematics, 2000, ftp://ftp.pdmi.ras.ru/pub/ publicat/preprint/2000/ 01-00.ps.gz.
7. Martin Davis, Hilary Putnam, A Computing Procedure for Quantification Theory, Journal of the ACM (JACM), v.7 n.3, p.201-215, July 1960 [doi〉10.1145/321033.321034]
8. T. FederandR. Motwani. Worst-case timebounds for coloring and satisfiability problems. Manuscript, September 1998.
9. J. Gramm, E. A. Hirsch, R. Niedermeier, and P. Rossmanith. Better worst-case upper bounds for MAX-2-SAT. 3rd Worksh. on the Satisfiability Problem, 2000, http://ssor.twi.tude/ft.nl/ Nwarners/SAT2000abstr/hirsch.html.
10. Edward A. Hirsch, Two new upper bounds for SAT, Proceedings of the ninth annual ACMSIAM symposium on Discrete algorithms, p.521-530, January 25-27, 1998, San Francisco, California, United States
11. T. R. Jensen and B. Tort. Graph Coloring Problems. Ser. Discrete Mathematics and Optimization. John Wiley & Sons, Inc., New York, 1995.
12. O. Kullmann, New methods for 3-SAT decision and worst-case analysis, Theoretical Computer Science, v.223 n.1-2, p.1-72, July 28, 1999 [doi〉10.1016/S0304-3975(98) 00017-6]
13. O. Kullmann and H. Luckhardt. Various upper bounds on the complexity of algorithms for deciding propositional tautologies. Manuscript available from kullmann@mi.informatik. unifrankfurt. de, 1994.
14. Vipin Kumar, Algorithms for constraint-satisfaction problems: a survey, AI Magazine, v.13 n.1, p.32-44, Spring 1992
15. E. L. Lawler. A note on the complexity of the chromatic number problem. Inf. Proc. Lett. 5 (3):66-67, August 1976.
16. H. Luckhardt. Obere Komplexitatsschranken ffir TAUT- Entscheidungen. Proc. Frege Conf., Schwerin, pp. 331-337. Akademie-Verlag, 1984.
17. B. Monien and E. Speckenmeyer. Solving satisfiability in less than 2 n steps. Discrete Appl. Math. 10(3):287-295, March 1985.
18. R. Paturi, P. Pudlák, M. E. Saks, F. Zane, An Improved Exponential-Time Algorithm for k-SAT, Proceedings of the 39th Annual Symposium on Foundations of Computer Science, p.628, November 08-11, 1998
19. A. D. Petford, D. J. Welsh, A randomised 3-colouring algorithm, Discrete Mathematics, v.74 n.1-2, p.253-261, 1989 [doi〉10.1016/0012-365X(89)90214-8]
20. Robert Rodosek, A New Approach on Solving 3-Satisfiability, Proceedings of the International Conference AISMC-3 on Artificial Intelligence and Symbolic Mathematical Computation, p.197-212, September 23-25, 1996
21. Ingo Schiermeyer, Solving 3-Satisfiability in Less Then 1, 579n Steps, Selected Papers from the Workshop on Computer Science Logic, p.379-394, September 28-October 02, 1992
22. Ingo Schiermeyer, Deciding 3-Colourability in Less Than O(1.415n) Steps, Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science, p.177-188, June 16-18, 1993
23. Uwe Schöning, A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p.410, October 17-18, 1999
24. B. Selman. Satisfiability testing: theory and practice. DI- MA CS Worksh. Faster Exact Solutions for NP-Hard Problems, February 2000.
25. Romulus Dan Vlasie, Systematic Generation of Very Hard Cases for Graph 3-Colorability, Proceedings of the Seventh International Conference on Tools with Artificial Intelligence, p.14, November 05-08, 1995