A Search Procedure for Hamilton Paths and Circuits
From MaRDI portal
Publication:4044618
DOI10.1145/321850.321854zbMath0293.05140OpenAlexW2053191344WikidataQ56138397 ScholiaQ56138397MaRDI QIDQ4044618
Publication date: 1974
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321850.321854
Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths ⋮ A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates ⋮ HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle ⋮ An extension of the multi-path algorithm for finding Hamilton cycles ⋮ The Asymmetric Travelling Salesman Problem In Sparse Digraphs. ⋮ Using matrices to link conflict evolution and resolution in a graph model ⋮ A matrix-based approach to searching colored paths in a weighted colored multidigraph ⋮ On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs ⋮ Hamiltonian walks on the Sierpinski gasket ⋮ Counting Hamiltonian cycles in bipartite graphs
