Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph

DOI10.1145/356022.356030zbMath0511.05041OpenAlexW2026273633WikidataQ56138395 ScholiaQ56138395MaRDI QIDQ4749863

Silvano Martello

Publication date: 1983

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/356022.356030

zbMATH Keywords

Hamiltonian circuitdepth-first searchrandomly generated digraphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Algorithms in computer science (68W99)

Related Items (6)

Asymptotic and finite size parameters for phase transitions: Hamiltonian circuit as a case study ⋮ An inexact algorithm for the sequential ordering problem ⋮ A production planning problem in FMS ⋮ HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle ⋮ Search algorithms in type theory ⋮ Counting Hamiltonian cycles in bipartite graphs

This page was built for publication: Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph