Asymptotic and finite size parameters for phase transitions: Hamiltonian circuit as a case study

Information Processing Letters

Volumn 65, Issue 5, 1998, Pages 241-245

  Frank, Jeremy ^a   Gent, Ian P ^b   Walsh, Toby ^b  

^a NASA AMES RESEARCH CENTER   (United States)

^b UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

Analysis of algorithms; Computational complexity; Constrainedness; Finite size scaling; Phase transitions

Indexed keywords

EID: 0042853685     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00222-6     Document Type: Article

References (16)

1. D. Angluin, L.G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings, J. Comput. System Sci. 18 (2) (1979) 155-193.
2. J. Beardwood, J.H. Halton, J.M. Hammersley, The shortest path through many points, in: Proc. Cambridge Philos. Soc. 55 (1959) 299-327.
3. P. Cheeseman, B. Kanefsky, W.M. Taylor, Where the really hard problems are, in: Proc. 12th IJCAI, Sydney, Australia, 1991, pp. 331-337.
4. J. Frank, C. Martel, Phase transitions in random graphs, in: Proc. Workshop on Studying and Solving Really Hard Problems, CP-95, 1995.
5. I.P. Gent, E. MacIntyre, P. Prosser, T. Walsh, Scaling effects in the CSP phase transition, in: U. Montanari, F. Rossi (Eds.), Principles and Practice of Constraint Programming - CP95, Springer, Berlin, 1995, pp. 70-87.
6. I.P. Gent, E. MacIntyre, P. Prosser, T. Walsh, The constrainedness of search, in: Proc. AAAI-96, Portland, OR, 1996, pp. 246-252.
7. I.P. Gent, T. Walsh, Easy problems are sometimes hard, Artificial Intelligence 70 (1994) 335-345.
8. I.P. Gent, T. Walsh, Phase transitions and annealed theories: Number partitioning as a case study, in: Proc. ECAI-96, Budapest, 1996, pp. 170-174.
9. I.P. Gent, T. Walsh, The TSP phase transition, Artificial Intelligence 88 (1996) 349-358.
10. T. Hogg, C. Williams, The hardest constraint problems: A double phase transition, Artificial Intelligence 69 (1994) 359-377.
11. S. Kirkpatrick, B. Selman, Critical behavior in the satisfiability of random boolean expressions, Science 264 (1994) 1297-1301.
12. A.D. Korshunov, The main properties of random graphs with a large number of vertices and edges, Russian Math. Surveys (1985) 121-198.
13. A.D. Koršunov, Solution of a problem of Erdös and Rényi on Hamiltonian cycles in nonoriented graphs, Soviet Math. Dokl. 17 (3) (1976) 760-764.
14. S. Martello, An enumerative algorithm for finding Hamiltonian circuits in a directed graph, ACM Trans. Math. Software 9 (1983) 131-138.
15. B. Selman, H. Kautz, B. Cohen, Noise strategies for improving local search, in: Proc. 12th AAAI-94, Seattle, WA, 1994, pp. 337-343.
16. B.M. Smith, S.A. Grant, Sparse constraint graphs and exceptionally hard problems, in: Proc. IJCAI-95, Montreal, Que., 1995, pp. 646-651.