An improved upper bound on the non-3-colourability threshold

Information Processing Letters

Volumn 65, Issue 1, 1998, Pages 17-23

  Dunne, Paul E ^a   Zito, Michele ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

3 Colouring; Phase transition threshold

Indexed keywords

EID: 0013367211     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00193-2     Document Type: Article

References (9)

1. D. Angluin, L.G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings, J. Comput. System Sci. 18 (1979) 82-93.
2. M.T. Chao, J. Franco, Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiable problem, Inform. Sci. 51 (1990) 289-314.
3. V. Chvátal, E. Szemerédi, Many hard examples for resolution, J. ACM 35 (1988) 759-768.
4. J. Crawford, L. Auton, Experimental results on the crossover point in satisfiability problems, in: Proc. AAAI-93, Washington, DC (1993) 21-27.
5. A.M. Frieze, S. Suen, Analysis of simple heuristics for random instances of 3-SAT, Manuscript, 1993.
6. A. Goerdt, A threshold for unsatisfiability, in: I. Havel, V. Krbec (Eds), Proc. 17th Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 629, Springer, Berlin, 1992, pp. 264-274.
7. T. Hogg, C.P. Williams, The hardest constraint problems: a double phase transition, Artificial Intelligence 69 (1994) 359-377.
8. L.M. Kirousis, E. Kranakis, D. Krizanc, A better upper bound for the unsatisfiability threshold, in: Proc. DIMACS Workshop Satisfiability Problem: Theory and Applications, 1996.
9. L.M. Kirousis, E. Kranakis, D. Krizanc, Approximating the unsatisfiability threshold of random formulas, in: Proc. 4th Ann. European Symp. on Algorithms, ESA'96, 1996.