Access Restriction

Author Welch, John T.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1966
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract A method of finding every cycle of an undirected linear graph by computation, rather than search, is presented. The method consists of three algorithms. The first produces a fundamental set of cycles from which all others can be generated. The second groups these cycles according to the nonseparable subgraphs of the original graph, and produces an ordering among groups that satisfies a condition required for the third algorithm. The third algorithm generates all and only cycles of the graph, without duplicates.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1966-04-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 13
Issue Number 2
Page Count 6
Starting Page 205
Ending Page 210

Open content in new tab

   Open content in new tab
Source: ACM Digital Library