The Gn,m Phase Transition is Not Hard for the Hamiltonian Cycle Problem

Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instances with the Gn,m phase transition between Hamiltonicity and non-Hamiltonicity. Instead all tested graphs of 100 to 1500 vertices are easily solved. When we artificially restrict the degree sequence with a bounded maximum degree, although there is some increase in difficulty, the frequency of hard graphs is still low. When we consider more regular graphs based on a generalization of knight's tours, we observe frequent instances of really hard graphs, but on these the average degree is bounded by a constant. We design a set of graphs with a feature our algorithm is unable to detect and so are very hard for our algorithm, but in these we can vary the average degree from O(1) to O(n). We have so far found no class of graphs correlated with the Gn,m phase transition which asymptotically produces a high frequency of hard instances.

[1]  E. Palmer.  Graphical evolution: an introduction to the theory of random graphs , 1985 .

[2]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[3]  GraphsJeremy Frank,et al.  Phase Transitions in the Properties of Random , 1995 .

[4]  P. Langley.  Systematic and nonsystematic search strategies , 1992 .

[5]  Alan M. Frieze,et al.  Finding hamilton cycles in sparse random graphs , 1987, J. Comb. Theory, Ser. B.

[6]  L. Pósa,et al.  Hamiltonian circuits in random graphs , 1976, Discret. Math..

[7]  Stephan Olariu,et al.  Welsh-Powell Opposition Graphs , 1989, Inf. Process. Lett..

[8]  Roberto J. Bayardo,et al.  Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances , 1996, CP.

[9]  Alan M. Frieze,et al.  Finding hidden Hamiltonian cycles , 1991, STOC '91.

[10]  Silvano Martello,et al.  Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph , 1983, TOMS.

[11]  Hans J. Berliner,et al.  Generating Hamiltonian Circuits without Backtracking from Errors , 1994, Theor. Comput. Sci..

[12]  Leslie G. Valiant,et al.  Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.

[13]  Rina Dechter,et al.  GSAT and Local Consistency , 1995, IJCAI.

[14]  Nicholas C. Wormald,et al.  Almost All Regular Graphs Are Hamiltonian , 1994, Random Struct. Algorithms.

[15]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[16]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[17]  Feng Luo,et al.  Exploring the k-colorable landscape with Iterated Greedy , 1993, Cliques, Coloring, and Satisfiability.

[18]  Joseph C. Culberson,et al.  Camouflaging independent sets in quasi-random graphs , 1993, Cliques, Coloring, and Satisfiability.

[19]  A. B. Baker.  Intelligent backtracking on constraint satisfaction problems: experimental and theoretical results , 1995 .

[20]  Basil. Vandegriend,et al.  Finding Hamiltonian cycles: algorithms, graphs and performance , 1998 .

[21]  David S. Johnson,et al.  Cliques, Coloring, and Satisfiability , 1996 .

[22]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[23]  William Kocay,et al.  An extension of the multi-path algorithm for finding hamilton cycles , 1992, Discret. Math..

[24]  Tad Hogg,et al.  The Hardest Constraint Problems: A Double Phase Transition , 1994, Artif. Intell..

[25]  Gopalakrishnan Vijayan,et al.  Worst case analysis of a graph coloring algorithm , 1985, Discret. Appl. Math..

[26]  Bart Selman,et al.  Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

[27]  Tad Hogg,et al.  Which Search Problems Are Random? , 1998, AAAI/IAAI.

[28]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[29]  Jeremy Frank,et al.  Asymptotic and Finite Size Parameters for Phase Transitions: Hamiltonian Circuit as a Case Study , 1998, Inf. Process. Lett..

[30]  B. Bollobás,et al.  An algorithm for finding hamilton paths and cycles in random graphs , 1987 .

[31]  John Mitchem,et al.  On Various Algorithms for Estimating the Chromatic Number of a Graph , 1976, Comput. J..

[32]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.