Basic cycle generation [H]

Authors:
Norman E. Gibbs
Affiliations:
College of William and Mary, Williamsburg, VA
Venue:
Communications of the ACM
Year:
1975

Citing 1
Cited 3

An algorithm for finding a fundamental set of cycles of a graph

Communications of the ACM

The Matrix Rearrangement Procedure for Graph-Theoretical Algorithms and Its Application to the Generation of Fundamental Cycles

ACM Transactions on Mathematical Software (TOMS)
Algorithms for Generating Fundamental Cycles in a Graph

ACM Transactions on Mathematical Software (TOMS)
Generating a set of fundamental cycles in a graph

ACM SIGACT News

Quantified Score

Hi-index	48.22

Visualization

Abstract

The PL/I procedure BASIC_GENERATOR is an implementation of Paton's algorithm [1] for finding a set of basic (fundamental) cycles of a finite undirected graph from its vertex adjacency matrix.