DeepAI AI Chat
Log In Sign Up

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

by   Michael Haythorpe, et al.
Flinders University

We consider a direct conversion of the, classical, set splitting problem to the directed Hamiltonian cycle problem. A constructive procedure for such a conversion is given, and it is shown that the input size of the converted instance is a linear function of the input size of the original instance. A proof that the two instances are equivalent is given, and a procedure for identifying a solution to the original instance from a solution of the converted instance is also provided. We conclude with two examples of set splitting problem instances, one with solutions and one without, and display the corresponding instances of the directed Hamiltonian cycle problem, along with a solution in the first example.


page 1

page 2

page 3

page 10

page 11

page 14

page 15

page 16


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

The FHCP Challenge Set, comprising of 1001 instances of Hamiltonian cycl...

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

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

Encoding Selection for Solving Hamiltonian Cycle Problems with ASP

It is common for search and optimization problems to have alternative eq...

Find Subtrees of Specified Weight and Cycles of Specified Length in Linear Time

We introduce a variant of DFS which finds subtrees of specified weight i...

Finding Long Directed Cycles Is Hard Even When DFVS Is Small Or Girth Is Large

We study the parameterized complexity of two classic problems on directe...

An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed Graphs

We present a polynomial space Monte Carlo algorithm that given a directe...

Backtracking (the) Algorithms on the Hamiltonian Cycle Problem

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