Finding a Lower Bound for k-Unbounded Hamiltonian Cycles

08/03/2022
by   Albert R. Jiang, et al.
0

Methods to determine the existence of Hamiltonian Cycles in graphs have been extensively studied. However, little research has been done following cases when no Hamiltonian Cycle exists. Let a vertex be "unbounded" if it is visited more than once in a path. Furthermore, let a k-Unbounded Hamiltonian Cycle be a path with finite length that visits every vertex, has adjacent start and end vertices, and contains k unbounded vertices. We consider a novel variant of the Hamiltonian Cycle Problem in which the objective is to find an m-Unbounded Hamiltonian Cycle where m is the minimum value of k such that a k-Unbounded Hamiltonian Cycle exists. We first consider the task on well-known non-Hamiltonian graphs. We then provide an exponential-time brute-force algorithm for the determination of an m-Unbounded Hamiltonian Cycle and discuss approaches to solve the variant through transformations to the Hamiltonian Cycle Problem and the Asymmetric Traveling Salesman Problem. Finally, we present a polynomial-time heuristic for the determination of an m-Unbounded Hamiltonian Cycle that is also shown to be an effective heuristic for the original Hamiltonian Cycle Problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/17/2018

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...
research
02/27/2019

Deterministic "Snakes and Ladders" Heuristic for the Hamiltonian Cycle Problem

We present a polynomial complexity, deterministic, heuristic for solving...
research
02/05/2019

Hamiltonicity below Dirac's condition

Dirac's theorem (1952) is a classical result of graph theory, stating th...
research
10/10/2018

Alternating Hamiltonian cycles in 2-edge-colored multigraphs

A path (cycle) in a c-edge-colored multigraph is alternating if no two c...
research
09/10/2020

Backtracking algorithms for constructing the Hamiltonian decomposition of a 4-regular multigraph

We consider a Hamiltonian decomposition problem of partitioning a regula...
research
02/01/2023

Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations

We study the problem of finding a Hamiltonian cycle under the promise th...
research
05/17/2021

Hamiltonian Cycle Problem is in P

In this paper we present the first deterministic polynomial time algorit...

Please sign up or login with your details

Forgot password? Click here to reset