A successful algorithm for solving directed Hamiltonian path problems

DOI10.1016/0167-6377(84)90069-5zbMath0531.90092OpenAlexW2039484262MaRDI QIDQ788642

Sharad Singhal, Gerald L. Thompson

Publication date: 1984

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(84)90069-5

zbMATH Keywords

ramification indexHamiltonian pathspanning arborescencesComputational experiencegraph-theoretic polynomial algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (2)

A randomized parallel branch-and-bound algorithm ⋮ A successful algorithm for the undirected Hamiltonian path problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
• Topological design of centralized computer networks—formulations and algorithms
• Hamiltonian Tours and Paths in Rectangular Lattice Graphs
• Algorithms for Large-scale Travelling Salesman Problems

This page was built for publication: A successful algorithm for solving directed Hamiltonian path problems