3-coloring in time script O sign(1.3289n)

Journal of Algorithms

Volumn 54, Issue 2, 2005, Pages 168-204

  Beigel, Richard ^a   Eppstein, David ^b  

^a 1120 Science and Engineering Offices   (United States)

^b Ringgold Standard Institution Informatics   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DATA REDUCTION; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING;

CONSTRAINT SATISFACTION (CSP) FORMULATION; DUALITY TRANSFORMATION; SATISFIABILITY; VERTEX GRAPHS;

ALGORITHMS;

EID: 12344334807     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2004.06.008     Document Type: Article

References (36)

1. N. Alon, and N. Kahale A spectral technique for coloring random 3-colorable graphs SIAM J. Comput. 26 6 1997 1733 1748 http://www.research.att.com/~kahale/papers/jour.ps
2. R. Beigel Finding maximum independent sets in sparse and general graphs Proc. 10th ACM-SIAM Symp. Discrete Algorithms 1999 ACM S856 S857 http://www.eecs.uic.edu/~beigel/papers/mis-soda.PS.gz
3. R. Beigel, and D. Eppstein 3-coloring in time O (1.3446 n): a no-MIS algorithm Proc. 36th IEEE Symp. Foundations of Computer Science 1995 IEEE 444 453 ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/1995/TR95-033/index.html
4. A. Blum, and D. Karger An O ̃ (n 3 / 14) -coloring algorithm for 3-colorable graphs Inform. Process. Lett. 61 1 1997 49 53 http://www.cs.cmu.edu/~avrim/Papers/color_new.ps.gz
5. J.M. Byskov, Chromatic number in time O (2.4023 n) using maximal independent sets, Tech. Rep. RS-02-45, Center for Basic Research in Computer Science (BRICS), December 2002
6. J.M. Byskov Algorithms for k-colouring and finding maximal independent sets Proc. 14th ACM-SIAM Symp. Discrete Algorithms 2003 ACM 456 469
7. J. Chen, I.A. Kanj, and W. Jia Vertex cover: further observations and further improvements Proc. 25th Internat. Workshop Graph-Theoretic Concepts in Computer Science Lecture Notes in Comput. Sci. vol. 1665 1999 Springer-Verlag 313 324 http://www.cs.tamu.edu/faculty/chen/wg.ps
8. E. Dantsin Two systems for proving tautologies, based on the split method J. Sov. Math. 22 1983 1293 1305 original Russian article appeared in 1981
9. E. Dantsin, and E.A. Hirsch Algorithms for k-SAT based on covering codes Preprint 1/2000, Steklov Inst. of Mathematics ftp://ftp.pdmi.ras.ru/pub/publicat/preprint/2000/01-00.ps.gz 2000
10. M. Davis, and H. Putnam A computing procedure for quantification theory J. ACM 7 3 1960 201 215
11. D. Eppstein Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction Proc. 12th ACM-SIAM Symp. Discrete Algorithms 2001 ACM 329 337 arxiv:/cs.DS/0009006
12. D. Eppstein Small maximal independent sets and faster exact graph coloring Proc. 7th Workshop Algorithms and Data Structures Lecture Notes in Comput. Sci. vol. 2125 2001 Springer-Verlag 462 470 arxiv:/cs.DS/0011009
13. D. Eppstein Quasiconvex analysis of backtracking algorithms ACM Computing Research Repository 2003 arxiv:/cs.DS/0304018
14. J. Gramm, E.A. Hirsch, R. Niedermeier, and P. Rossmanith Better worst-case upper bounds for MAX-2-SAT in: 3rd Workshop on the Satisfiability Problem http://ssor.twi.tudelft.nl/~warners/SAT2000abstr/hirsch.html 2000
15. E.A. Hirsch Two new upper bounds for SAT Proc. 9th ACM-SIAM Symp. Discrete Algorithms 1998 ACM 521 530 http://logic.pdmi.ras.ru/~hirsch/abstracts/soda98.html
16. T.R. Jensen, and B. Toft Graph Coloring Problems Ser. Discrete Math. and Optimization 1995 John Wiley & Sons New York
17. T. Jian An O (2 0.304 n) algorithm for solving maximum independent set problem IEEE Trans. Comput. C-35 9 1986 847 851
18. D.S. Johnson, M. Yannakakis, and C.H. Papadimitriou On generating all maximal independent sets Inform. Process. Lett. 27 3 1988 119 123
19. O. Kullmann New methods for 3-SAT decision and worst-case analysis Theoret. Comput. Sci. 223 1-2 1999 1 72 http://www.cs.toronto.edu/~kullmann/3neu.ps
20. O. Kullmann, and H. Luckhardt Various upper bounds on the complexity of algorithms for deciding propositional tautologies Manuscript available from kullmann@mi.informatik.uni-frankfurt.de 1994
21. V. Kumar Algorithms for constraint satisfaction problems: a survey AI Magazine 13 1 1992 32 44 http://citeseer.nj.nec.com/kumar92algorithms.html
22. E.L. Lawler A note on the complexity of the chromatic number problem Inform. Process. Lett. 5 3 1976 66 67
23. H. Luckhardt Obere Komplexitätsschranken für TAUT-Entscheidungen Proc. Frege Conf. Schwerin 1984 Akademie-Verlag 331 337
24. B. Monien, and E. Speckenmeyer Solving satisfiability in less than 2 n steps Discrete Appl. Math. 10 3 1985 287 295
25. J.W. Moon, and L. Moser On cliques in graphs Israel J. Math. 3 1965 23 28
26. P.M. Pardalos, J. Rappe, and M.G.C. Resende An exact parallel algorithm for the maximum clique problem High Performance Algorithms and Software in Nonlinear Optimization 1999 Kluwer Academic Publishers 279 300 http://www.research.att.com/~mgcr/abstracts/parclq.html
27. R. Paturi, P. Pudlák, M.E. Saks, and F. Zane An improved exponential-time algorithm for k-SAT Proc. 39th IEEE Symp. Foundations of Computer Science 1998 IEEE 628 637 http://www.math.cas.cz/~pudlak/ppsz.ps
28. A.D. Petford, and D.J.A. Welsh A randomised 3-colouring algorithm Discrete Math. 74 1-2 1989 253 261
29. J.M. Robson Algorithms for maximum independent sets J. Algorithms 7 3 1986 425 440
30. R. Rodošek A new approach on solving 3-satisfiability Proc. 3rd Internat. Conf. Artificial Intelligence and Symbolic Mathematical Computation Lecture Notes in Comput. Sci. vol. 1138 1996 Springer-Verlag 197 212 http://www-icparc.doc.ic.ac.uk/papers/a_new_approach_on_solving_3-satisfiabili. ps
31. I. Schiermeyer Solving 3-satisfiability in less than 1.579 n steps Proc. 6th Workshop Computer Science Logic Lecture Notes in Comput. Sci. vol. 702 1993 Springer-Verlag 379 394
32. I. Schiermeyer Deciding 3-colourability in less than O (1.415 n) steps Proc. 19th Internat. Workshop Graph-Theoretic Concepts in Computer Science Lecture Notes in Comput. Sci. vol. 790 1994 Springer-Verlag 177 182
33. U. Schöning A probabilistic algorithm for k-SAT and constraint satisfaction problems Proc. 40th IEEE Symp. Foundations of Computer Science 1999 IEEE 410 414
34. M. Shindo, and E. Tomita A simple algorithm for finding a maximum clique and its worst-case time complexity Sys. & Comp. in Japan 21 3 1990 1 13
35. R.E. Tarjan, and A.E. Trojanowski Finding a maximum independent set SIAM J. Comput. 6 3 1977 537 546
36. R.D. Vlasie Systematic generation of very hard cases for graph 3-colorability Proc. 7th IEEE Internat. Conf. Tools with Artificial Intelligence 1995 IEEE 114 119 http://www.essi.fr/~vlasier/PS/3paths.ps