ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Systematic generation of Hamiltonian circuits
Full text PdfPdf (612 KB)
Source
Communications of the ACM archive
Volume 9 ,  Issue 9  (September 1966) table of contents
Pages: 690 - 694  
Year of Publication: 1966
ISSN:0001-0782
Authors
S. M. Roberts  IBM Corp., Houston, TX
Benito Flores  Univ. of Houston, TX
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 23,   Citation Count: 4
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/365813.365842
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
BERGE, C. Theory of Graphs and Its Applications. Translated by A. Doig. John Wiley & Sons, New York, 1962, Chap. 11.
 
2
ROBERTS, S. M ., AND FLORES, B . An engineering approach to the traveling salesman problem. Man. Sci., to appear.

CITED BY  4
Frank Rubin, A Search Procedure for Hamilton Paths and Circuits, Journal of the ACM (JACM), v.21 n.4, p.576-580, Oct. 1974
Anneliese von Mayrhauser , Shao-Ming Simon Hsueh, An Ada deadlock testing algorithm based on control and communication flow graphs, Proceedings of the conference on TRI-Ada '92, p.450-457, November 16-20, 1992, Orlando, Florida, United States
James C. Tiernan, An efficient search algorithm to find the elementary circuits of a graph, Communications of the ACM, v.13 n.12, p.722-726, Dec. 1970
Silvano Martello, Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph, ACM Transactions on Mathematical Software (TOMS), v.9 n.1, p.131-138, March 1983
Collaborative Colleagues:
S. M. Roberts: colleagues
Benito Flores: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player