A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs

Authors:
John T. Welch, Jr.
Affiliations:
Goodyear Aerospace Corporation, Akron, Ohio
Venue:
Journal of the ACM (JACM)
Year:
1966

Citing 1
Cited 11

GIT—a heuristic program for testing pairs of directed line graphs for isomorphism

Communications of the ACM

Determinant factorization and cycle basis: encoding schemes for the representation of spanning trees on incomplete graphs

SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
A Cycle Generation Algorithm for Finite Undirected Linear Graphs

Journal of the ACM (JACM)
Algorithms for Generating Fundamental Cycles in a Graph

ACM Transactions on Mathematical Software (TOMS)
An efficient search algorithm to find the elementary circuits of a graph

Communications of the ACM
An algorithm for finding a fundamental set of cycles of a graph

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

Communications of the ACM
Circuit enumeration in an undirected graph

ACM-SE 16 Proceedings of the 16th annual Southeast regional conference
An all cycle algorithm for undirected graphs

ACM '73 Proceedings of the ACM annual conference
Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion

Journal of Discrete Algorithms
Relative clock synchronization in wireless networks

IEEE Communications Letters
An application of rough sets to graph theory

Information Sciences: an International Journal

Quantified Score

Hi-index	0.05

Visualization

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.