How much backtracking does it take to color random graphs? Rigorous results on heavy tails

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3258, Issue , 2004, Pages 742-746

  Jia, Haixia ^a   Moore, Cristopher ^a  

^a University of New Mexico   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; PROBABILITY;

ANALYTIC FUNCTIONS; BACKTRACKING ALGORITHM; BACKTRACKING SEARCH ALGORITHMS; DAVIS-PUTNAM-LOGEMANN-LOVELAND; GIANT COMPONENTS; GRAPH 3 COLORINGS; HEAVY-TAILED DISTRIBUTION; POSITIVE PROBABILITY;

GRAPH THEORY;

EID: 27744478755     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_58     Document Type: Article

References (13)

1. Dimitris Achlioptas, Paul Beame, and Michael Molloy, "A sharp threshold in proof complexity." Proc. 33rd Symp. on Theory of Computing 337-346.
2. D. Achlioptas and M. Molloy, "Analysis of a list-colouring algorithm on a random graph." Proc. 38th Foundations of Computer Science 204-212.
3. D. Achlioptas and C. Moore, "Almost all graphs of degree 4 are 3-colorable." Proc. 34th Symp. on Theory of Computing 199-208, and
4. J. Comp. & Sys. Sci. 67 (2003) 441-471, special issue for STOC 2002.
5. H. Chen, C.P. Gomes and B. Selman, "Formal models of heavy-tailed behavior in combinatorial search." Proc. 7th Intl. Conf. on the Principles and Practice of Constraint Programming (2001) 408-422.
6. A. Davenport and E.P.K. Tsang, "An empirical investigation into the exceptionally hard problems." Proc. Workshop on Constraint-based Reasoning 46-53.
7. C. Deroulers and R. Monasson, "Critical behaviour of combinatorial search algorithms, and the unitary-propagation universality class." Preprint, condmat/0405319.
8. I. Gent, and T. Walsh, "Easy problems are sometimes hard." Artificial Intelligence 70 (1993) 335-345.
9. C.P. Gomes, B. Selman and N. Crato, "Heavy-Tailed Distributions in Combinatorial Search." Proc. 3rd Intl. Conf. on Principles and Practices of Constraint Programming (1997) 121-135.
10. C.P. Gomes, B. Selman and H.A. Kautz, "Boosting Combinatorial Search Through Randomization." Proc. 15th Natl. Conf. on Artificial Intelligence (1998) 431-437.
11. T. Hogg and C.P. Williams, "The Hardest Constraint Problems: A Double Phase Transition." Artificial Intelligence 69(1-2) (1994) 359-377.
12. M. Luby, A. Sinclair, and D. Zuckerman, "Optimal speedup of las vegas algorithms." Information Processing Letters (1993) 173-180.
13. B. Selman, H. Kautz, and B. Cohen, "Local search strategies for satisfiability testing." In D. Johnson and M. Trick, Eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26 (1993) 521-532.