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

02/27/2019
by   Michael Haythorpe, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/25/2018

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

We present a benchmark set for Traveling salesman problem (TSP) with cha...
research
02/27/2019

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...
research
06/24/2019

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...
research
04/13/2020

Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle

In this paper we consider the following total functional problem: Given ...
research
10/05/2020

Evolving test instances of the Hamiltonian completion problem

Predicting and comparing algorithm performance on graph instances is cha...
research
09/18/2019

Encoding Selection for Solving Hamiltonian Cycle Problems with ASP

It is common for search and optimization problems to have alternative eq...
research
07/01/2021

Backtracking (the) Algorithms on the Hamiltonian Cycle Problem

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

Please sign up or login with your details

Forgot password? Click here to reset