DeepAI AI Chat
Log In Sign Up

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

05/17/2018
by   Volker Turau, et al.
tuhh
0

It is known for some time that a random graph G(n,p) contains w.h.p. a Hamiltonian cycle if p is larger than the critical value p_crit= ( n + n + ω_n)/n. The determination of a concrete Hamiltonian cycle is even for values much larger than p_crit a nontrivial task. In this paper we consider random graphs G(n,p) with p in Ω̃(1/√(n)), where Ω̃ hides poly-logarithmic factors in n. For this range of p we present a distributed algorithm A_HC that finds w.h.p. a Hamiltonian cycle in O( n) rounds. The algorithm works in the synchronous model and uses messages of size O( n) and O( n) memory per node.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/24/2018

Fast and Efficient Distributed Computation of Hamiltonian Cycles in Random Graphs

We present fast and efficient randomized distributed algorithms to find ...
08/03/2022

Finding a Lower Bound for k-Unbounded Hamiltonian Cycles

Methods to determine the existence of Hamiltonian Cycles in graphs have ...
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...
04/13/2020

Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle

In this paper we consider the following total functional problem: Given ...
06/28/2015

Simultaneously Solving Computational Problems Using an Artificial Chemical Reactor

This paper is centered on using chemical reaction as a computational met...
02/28/2018

Hamiltonian cycles in hypercubes with faulty edges

Szepietowski [A. Szepietowski, Hamiltonian cycles in hypercubes with 2n-...
01/29/2018

A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals

In this paper, an iterative algorithm is designed to compute the sparse ...