Thumbnail
Access Restriction
Subscribed

Author Corneil, D. G. ♦ Gotlieb, C. G.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract 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.
Description Affiliation: Univ. of Toronto, Toronto, Canada (Gotlieb, C. G.; Corneil, D. G.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 10
Issue Number 12
Page Count 4
Starting Page 780
Ending Page 783


Open content in new tab

   Open content in new tab
Source: ACM Digital Library