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
Basic cycle generation [H]
Full text PdfPdf (168 KB)
Source
Communications of the ACM archive
Volume 18 ,  Issue 5  (May 1975) table of contents
Pages: 275 - 276  
Year of Publication: 1975
ISSN:0001-0782
Author
Norman E. Gibbs  College of William and Mary, Williamsburg, VA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 23,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   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/360762.360778
What is a DOI?

ABSTRACT

The PL/I procedure BASIC_GENERATOR is an implementation of Paton's algorithm [1] for finding a set of basic (fundamental) cycles of a finite undirected graph from its vertex adjacency matrix.


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
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]

CITED BY  3
Narsingh Deo , G. Prabhu , M. S. Krishnamoorthy, Algorithms for Generating Fundamental Cycles in a Graph, ACM Transactions on Mathematical Software (TOMS), v.8 n.1, p.26-42, March 1982
Tetsuro Ito , Makoto Kizawa, The Matrix Rearrangement Procedure for Graph-Theoretical Algorithms and Its Application to the Generation of Fundamental Cycles, ACM Transactions on Mathematical Software (TOMS), v.3 n.3, p.227-231, Sept. 1977
C. J. Eqvhazy , T. B. Ramsay, Generating a set of fundamental cycles in a graph, ACM SIGACT News, v.17 n.1, p.78-82, June 1985

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.1 Numerical Algorithms and Problems
          Subjects: Computations on matrices
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Computations on discrete structures


General Terms:
Algorithms, Design, Theory


Keywords:
adjacency matrix, basic cycle, fundamental cycle, graph, spanning tree, vertex

Collaborative Colleagues:
Norman E. Gibbs: 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