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

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Silvano Martello Instituto di Automatica, University of Bologna, 1-40136 Bologna, Itlay
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 9 Issue 1, March 1983
Pages 131-138
ACM New York, NY, USA
table of contents doi>10.1145/356022.356030
Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph Published by ACM 1983 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 19
· Downloads (cumulative): 470
· Citation Count: 5


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


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

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder