Basic cycle generation [H]
- 1 May 1975
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 18 (5) , 275-276
- https://doi.org/10.1145/360762.360778
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.Keywords
This publication has 1 reference indexed in Scilit:
- An algorithm for finding a fundamental set of cycles of a graphCommunications of the ACM, 1969