DeepAI AI Chat
Log In Sign Up

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

by   J. Culberson, et al.

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.


page 1

page 2

page 3

page 4


Feedback Vertex Set on Hamiltonian Graphs

We study the computational complexity of Feedback Vertex Set on subclass...

Algorithms for #BIS-hard problems on expander graphs

We give an FPTAS and an efficient sampling algorithm for the high-fugaci...

On graphs of bounded degree that are far from being Hamiltonian

Hamiltonian cycles in graphs were first studied in the 1850s. Since then...

Backtracking (the) Algorithms on the Hamiltonian Cycle Problem

Even though the Hamiltonian cycle problem is NP-complete, many of its pr...

A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals

In this paper, an iterative algorithm is designed to compute the sparse ...

Constructing Concrete Hard Instances of the Maximum Independent Set Problem

We provide a deterministic construction of hard instances for the maximu...

An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem

The Hamiltonian cycle problem (HCP) is an important combinatorial proble...