The dynamics of proving uncolourability of large random graphs: I. Symmetric colouring heuristic

Journal of Physics A: Mathematical and General

Volumn 36, Issue 43, 2003, Pages 11055-11067

  Ein Dor, Liat ^a   Monasson, Rémi ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0242594532     PISSN: 03054470     EISSN: None     Source Type: Journal    
DOI: 10.1088/0305-4470/36/43/027     Document Type: Article

References (27)

1. Garey M R and Johnson D S 1979 Computers and Intractibility: A Guide to the Theory of NP-Completeness (San Francisco, CA: Freeman)
2. Cheeseman P, Kanefsky B and Taylor M W 1991 Proc. IJCAI-91 ed J Mylopoulos and R Reiter (San Mateo, CA: Morgan Kaufmann) p 331
3. Turner J S 1988 J. Algorithms 9 63
4. Leighton F T 1979 J. Res. Natl Bur. Stand. 84 489
5. de Werra D 1985 Eur. J. Oper. Res. 19 151
6. Briggs P, Cooper K D and Torczon L 1994 ACM Trans. Prog. Lang. Syst. 16 428
7. Chaow F C and Hennessy J L 1990 ACM Trans. Prog. Lang. Syst. 12 501
8. Meurdesoif P and Rottembourg B 2001 RAIRO Oper. Res. 35 211
9. Miller R E and Thatcher J W (ed) 1972 Complexity of Computer Computations (New York: Plenum) p 85
10. Achlioptas D and Friedgut E 1999 Random Struct. Algorithms 14 63
11. Culbersome J C and Gent I P 2001 Theor. Comput. Sci. 265 227
12. Alon N and Spencer J 1992 The Probabilistic Method (New York; Wiley)
13. Kaporis A C, Kirousis L M and stamatiou Y C 2000 Electron. J. Combin. 7 R29
14. Brelaz D 1979 Commun. ACM 22 251
15. Achlioptas D and Moore C 2002 Proc. 34th Ann. ACM Symp. on Theory of Computing (19-21 May) (Montréal: ACM)
16. Mulet R, Pagnani A, Weigt M and Zecchina R 2002 Phys. Rev. Lett. 89 268701
17. Boettcher S and Percus A 2001 Phys. Rev. Lett. 86 5211
18. Davis M and Putman H 1960 J. Ass. Comput. Mach. 7 201 Davis M, Logemann G and Loveland D 1962 A machine program for theorem proving Commun. ACM 5 394
19. Davis M and Putman H 1960 J. Ass. Comput. Mach. 7 201 Davis M, Logemann G and Loveland D 1962 A machine program for theorem proving Commun. ACM 5 394
20. Cocco S and Monasson R 2001 Phys. Rev. Lett. 86 1654 Cocco S and Monasson R 2001 Eur. Phys. J. B 22 505
21. Cocco S and Monasson R 2001 Phys. Rev. Lett. 86 1654 Cocco S and Monasson R 2001 Eur. Phys. J. B 22 505
22. Cocco S, Montanari A, Monasson R and Semerjian G 2003 Approximate analysis of algorithms with physical methods Preprint cs.CC/0302003
23. Weigt M and Hartmann A K 2001 Phys. Rev. Lett. 86 1658
24. Ein-Dor L and Monasson R The dynamics of proving uncolourability of large random graphs, II Asymmetric Colouring Heuristic in preparation
25. Achlioptas D and Molloy M 1997 Proc. FOCS vol 97 p 204
26. Cocco S and Monasson R 2003 Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances Preprint
27. Knuth D E 1968 The Art of Computer Programming vol 1: Fundamental Algorithms (New York: Addison-Wesley) section 2.2.1