A Cycle Generation Algorithm for Finite Undirected Linear Graphs

Authors:
Norman E. Gibbs
Affiliations:
Computer Science Center, College of William and Mary, Williamsburg, Va. and Purdue University, Department of Computer Science, West Lafayette, Indiana
Venue:
Journal of the ACM (JACM)
Year:
1969

Citing 3
Cited 6

A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs

Journal of the ACM (JACM)
Algorithms for finding a fundamental set of cycles for an undirected linear graph

Communications of the ACM
Numerical applications: Cycle algorithms for undirected linear graphs and some immediate applications

ACM '65 Proceedings of the 1965 20th national conference

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
Algorithm 492: Generation of all the cycles of a graph from a set of basic cycles [H]

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
A planarity algorithm based on the Kuratowski theorem

AFIPS '70 (Spring) Proceedings of the May 5-7, 1970, spring joint computer conference

Quantified Score

Hi-index	0.02

Visualization

Abstract

When the algorithms of J. T. Welch, Jr. were implemented it was discovered that they did not perform as described. The generation of all cycles from a basis is faulty. The generation of the basis is apparently correct. A modified version of Welch's Algorithm 3 is presented. The reasons for modifying Welch's algorithms are presented with examples.