Systematic generation of Hamiltonian circuits

Authors:
S. M. Roberts;Benito Flores
Affiliations:
IBM Corp., Houston, TX;Univ. of Houston, TX
Venue:
Communications of the ACM
Year:
1966

Citing 0
Cited 4

An Ada deadlock testing algorithm based on control and communication flow graphs

TRI-Ada '92 Proceedings of the conference on TRI-Ada '92
A Search Procedure for Hamilton Paths and Circuits

Journal of the ACM (JACM)
Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph

ACM Transactions on Mathematical Software (TOMS)
An efficient search algorithm to find the elementary circuits of a graph

Communications of the ACM

Quantified Score

Hi-index	48.23

Visualization

Abstract

For a combinatorial matrix which may specify both directed and nondirected arcs, the paper describes a computer program which generates systematically and exhaustively all the Hamiltonian circuits. Specific application is made to the “traveling salesman” problem.