A successful algorithm for solving directed Hamiltonian path problems

  • Authors:

  • Gerald L. Thompson;Sharad Singhal

  • Affiliations:

  • Management Science Research Group, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA 15213, USA;Management Science Research Group, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA 15213, USA

  • Venue:
  • Operations Research Letters
  • Year:
  • 1984

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we present a graph-theoretic polynomial algorithm which has positive probability of finding a Hamiltonian path in a given graph, if there is one; if the algorithm fails, it can be rerun with a randomly chosen starting solution, and there is again a positive probability it will find an answer. If there is no Hamiltonian path, the algorithm will always terminate with failure. We call this a Successful Algorithm because it has high (close to 1) empirical probability of success and it works in polynomial time. Some basic theoretical results concerning spanning arborescences of a graph are given. The concept of a ramification index is defined and it is shown that ramification index of a Hamiltonian path is zero. The algorithm starts with finding any spanning arborescence and by suitable pivots it endeavors to reduce the ramification index to zero. Probabilistic properties of the algorithm are discussed. Computational experience with graphs up to 30 000 nodes is included.