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
An efficient search algorithm to find the elementary circuits of a graph
Full text PdfPdf (487 KB)
Source
Communications of the ACM archive
Volume 13 ,  Issue 12  (December 1970) table of contents
Pages: 722 - 726  
Year of Publication: 1970
ISSN:0001-0782
Author
James C. Tiernan  Univ. of California, San Diego
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 24,   Downloads (12 Months): 208,   Citation Count: 13
Additional Information:

references   cited by   index terms  

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/362814.362819
What is a DOI?

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, CLAUDE. The Theory of Graphs and its Applications. Wiley, New York, 1966.
2
C. G. Gotlieb , D. G. Corneil, Algorithms for finding a fundamental set of cycles for an undirected linear graph, Communications of the ACM, v.10 n.12, p.780-783, Dec. 1967  [doi>10.1145/363848.363861]
 
3
Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
4
Keith Paton, An algorithm for finding a fundamental set of cycles of a graph, Communications of the ACM, v.12 n.9, p.514-518, Sept. 1969  [doi>10.1145/363219.363232]
5
S. M. Roberts , Benito Flores, Systematic generation of Hamiltonian circuits, Communications of the ACM, v.9 n.9, p.690-694, Sept. 1966  [doi>10.1145/365813.365842]
 
6
TRAINER ,I. L., AND GILL, A. On an asymptotic optimization problem in finite, directed, weighted graphs. Inform. Contr. lS, 6 (Dec. 1968), 527-533.
7
John T. Welch, Jr., A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs, Journal of the ACM (JACM), v.13 n.2, p.205-210, April 1966  [doi>10.1145/321328.321331]

CITED BY  13
Maciej M. Syslo, Algorithm 459: the elementary circuits of a graph, Communications of the ACM, v.16 n.10, p.632-633, Oct. 1973
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
Greg Snider, Performance-constrained pipelining of software loops onto reconfigurable hardware, Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays, February 24-26, 2002, Monterey, California, USA
Vicki H. Allan , Reese B. Jones , Randall M. Lee , Stephen J. Allan, Software pipelining, ACM Computing Surveys (CSUR), v.27 n.3, p.367-432, Sept. 1995
Richard A. Huff, Lifetime-sensitive modulo scheduling, ACM SIGPLAN Notices, v.28 n.6, p.258-267, June 1993
Alexandre E. Eichenberger , Edward S. Davidson , Santosh G. Abraham, Minimum register requirements for a modulo schedule, Proceedings of the 27th annual international symposium on Microarchitecture, p.75-84, November 30-December 02, 1994, San Jose, California, United States
B. Ramakrishna Rau, Iterative modulo scheduling: an algorithm for software pipelining loops, Proceedings of the 27th annual international symposium on Microarchitecture, p.63-74, November 30-December 02, 1994, San Jose, California, United States
Herbert Weinblatt, A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph, Journal of the ACM (JACM), v.19 n.1, p.43-56, Jan. 1972
Heejung Lee , Hyo-Won Suh, Workflow structuring and reengineering method for design process, Computers and Industrial Engineering, v.51 n.4, p.698-714, December, 2006
E. Girard , D. Bastin , J. C. Rault, A collection of graph analysis APL functions, Proceedings of the fourth international conference on APL, p.73-101, January 1972
Stefan Andrei , Wei Ngan Chin , Albert Mo Kim Cheng , Mihai Lupu, Automatic Debugging of Real-Time Systems Based on Incremental Satisfiability Counting, IEEE Transactions on Computers, v.55 n.7, p.830-842, July 2006
E. M. Nguer , N. Spyratos, A user-friendly interface for evaluating preference queries over tabular data, Proceedings of the 26th annual ACM international conference on Design of communication, September 22-24, 2008, Lisbon, Portugal
Jean-Loup Baer , Robert Caughey, Segmentation and optimization of programs from cyclic structure analysis, Proceedings of the November 16-18, 1971, fall joint computer conference, November 16-18, 1971, Las Vegas, Nevada

INDEX TERMS

Keywords:
algorithm, circuit search algorithm, graph theory, path search algorithm, searching


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