Algorithms for Generating Fundamental Cycles in a Graph
- 1 March 1982
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 8 (1) , 26-42
- https://doi.org/10.1145/355984.355988
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Minimum-length fundamental cycle setIEEE Transactions on Circuits and Systems, 1979
- The Matrix Rearrangement Procedure for Graph-Theoretical Algorithms and Its Application to the Generation of Fundamental CyclesACM Transactions on Mathematical Software, 1977
- Basic cycle generation [H]Communications of the ACM, 1975
- Note on a modification of the fundamental cycles finding algorithmInformation Processing Letters, 1974
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- An algorithm for finding a fundamental set of cycles of a graphCommunications of the ACM, 1969
- Algorithms for finding a fundamental set of cycles for an undirected linear graphCommunications of the ACM, 1967
- A Mechanical Analysis of the Cyclic Structure of Undirected Linear GraphsJournal of the ACM, 1966
- A Graph-Theoretic Algorithm for Matching Chemical Structures.Journal of Chemical Documentation, 1965