A Search Procedure for Hamilton Paths and Circuits

DOI10.1145/321850.321854MaRDI QIDQ4044618zbMATH OpenOpenAlexWikidataFDO

Authors F. Rubin

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

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35)

Cited in

(11)

• An extension of the multi-path algorithm for finding Hamilton cycles
• On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs
• HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle
• A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
• Counting Hamiltonian cycles in bipartite graphs
• Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths
• Hamiltonian walks on the Sierpinski gasket
• The Asymmetric Travelling Salesman Problem In Sparse Digraphs.
• On the packing chromatic numbers of four and five regular connected spanning subgraphs of \(\mathbb{Z}^3\)
• A matrix-based approach to searching colored paths in a weighted colored multidigraph
• Using matrices to link conflict evolution and resolution in a graph model

This page was built for publication: A Search Procedure for Hamilton Paths and Circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4044618)