Algorithms for finding a fundamental set of cycles for an undirected linear graph

@article{Gotlieb1967AlgorithmsFF,
  title={Algorithms for finding a fundamental set of cycles for an undirected linear graph},
  author={Calvin C. Gotlieb and Derek G. Corneil},
  journal={Commun. ACM},
  year={1967},
  volume={10},
  pages={780-783}
}
Given the adjacency matrix of the graph, the algorithm presented in this paper finds a spanning tree and then constructs the set of fundamental cycles. Our algorithm is slower than an algorithm presented by Welch by a ratio of N/3 (N is the number of nodes) but requires less storage. For graphs with a large number of nodes and edges, when storage is limited our algorithm is superior to Welch's; however, when the graphs are small, or machine storage is very large, Welch's algorithm is superior… CONTINUE READING
Highly Cited
This paper has 25 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

Similar Papers

Loading similar papers…