Minimum-length fundamental cycle set
- 1 October 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems
- Vol. 26 (10) , 894-895
- https://doi.org/10.1109/tcs.1979.1084563
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- On the fundamental cycle set graphIEEE Transactions on Circuits and Systems, 1982
- 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
- A Cycle Generation Algorithm for Finite Undirected Linear GraphsJournal of the ACM, 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