DeepAI AI Chat
Log In Sign Up

Fast algorithms for solving the Hamilton Cycle problem with high probability

by   Michael Anastos, et al.

We study the Hamilton cycle problem with input a random graph G=G(n,p) in two settings. In the first one, G is given to us in the form of randomly ordered adjacency lists while in the second one we are given the adjacency matrix of G. In each of the settings we give a deterministic algorithm that w.h.p. either it finds a Hamilton cycle or it returns a certificate that such a cycle does not exists, for p > 0. The running times of our algorithms are w.h.p. O(n) and O(n/p) respectively each being best possible in its own setting.


page 1

page 2

page 3

page 4


A fast algorithm on average for solving the Hamilton Cycle problem

We present CertifyHAM, an algorithm which takes as input a graph G and e...

Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle

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

Fast Generation of Unlabelled Free Trees using Weight Sequences

In this paper, we introduce a new representation for ordered trees, the ...

Reconfiguration of Digraph Homomorphisms

For a fixed graph H, the H-Recoloring problem asks whether for two given...

Fast recognition of some parametric graph families

We identify all [1, λ, 8]-cycle regular I-graphs and all [1, λ, 8]-cycle...

On the Utility of Buffers in Pick-n-Swap Based Lattice Rearrangement

We investigate the utility of employing multiple buffers in solving a cl...

On the Inverse of Forward Adjacency Matrix

During routine state space circuit analysis of an arbitrarily connected ...