A successful algorithm for the undirected Hamiltonian path problem

DOI10.1016/0166-218X(85)90011-3zbMath0571.68049MaRDI QIDQ1061488

Gerald L. Thompson, Sharad Singhal

Publication date: 1985

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

ramification indexprobabilistic algorithmsspanning treepolynomial algorithmundirected graphHamiltonian graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A successful algorithm for solving directed Hamiltonian path problems
• Limit distribution for the existence of Hamiltonian cycles in a random graph
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• On the complexity of finding multi-constrained spanning trees
• Hamiltonian circuits in random graphs
• Topological design of centralized computer networks—formulations and algorithms
• Hamiltonian Tours and Paths in Rectangular Lattice Graphs

This page was built for publication: A successful algorithm for the undirected Hamiltonian path problem