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

Algorithms for finding a fundamental set of cycles for an undirected linear graph,10.1145/363848.363861,Communications of The ACM,C. G. Gotlieb,Derek

Algorithms for finding a fundamental set of cycles for an undirected linear graph   (Citations: 14)
BibTex | RIS | RefWorks Download
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. Timing estimates and storage requirements for both methods are presented.
Journal: Communications of The ACM - CACM , vol. 10, no. 12, pp. 780-783, 1967
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: