DeepAI AI Chat
Log In Sign Up

FHCP Challenge Set: The First Set of Structurally Difficult Instances of the Hamiltonian Cycle Problem

by   Michael Haythorpe, et al.
Flinders University

The FHCP Challenge Set, comprising of 1001 instances of Hamiltonian cycle problem, is introduced. This set is the first to contain instances of Hamiltonian cycle problem for which the primary difficulty is the underlying graph structure, rather than simply size. A summary of the kinds of graphs contained in the FHCP Challenge Set is given. A discussion of the results of the FHCP Challenge, a year-long competition to solve all instances of the FHCP Challenge Set first announced at the 59th Annual Meeting for the Australian Mathematical Society, is also included.


page 1

page 2

page 3

page 4


A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem

We present a benchmark set for Traveling salesman problem (TSP) with cha...

A Linearly-growing Conversion from the Set Splitting Problem to the Directed Hamiltonian Cycle Problem

We consider a direct conversion of the, classical, set splitting problem...

On non-Hamiltonian cycle sets of satisfying Grinberg's Equation

In [1] we used a cycle basis of the cycle space to represent a simple co...

Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle

In this paper we consider the following total functional problem: Given ...

Evolving test instances of the Hamiltonian completion problem

Predicting and comparing algorithm performance on graph instances is cha...

A Distributed Algorithm for Finding Hamiltonian Cycles in Random Graphs in O(log n) Time

It is known for some time that a random graph G(n,p) contains w.h.p. a H...

Backtracking (the) Algorithms on the Hamiltonian Cycle Problem

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