Proceedings ArticleDOI
An all cycle algorithm for undirected graphs
E. Dixon,S. Goodman +1 more
- pp 430
TLDR
In this paper, an algorithm for finding the fundamental cycle set from a spanning tree and a branch and bound option which will find the longest cycle in a graph is presented, which is based on a more efficient branching procedure than was used previously.Abstract:
An algorithm is presented which generates, without duplication, all the simple cycles of an undirected graph. The algorithm employs the concept of a fundamental cycle set and is based on a more efficient branching procedure than was used previously.1,2 As a consequence both execution time and storage requirements are greatly reduced. Also included is an improved method for finding the fundamental cycle set from a spanning tree, and a branch and bound option which will find the longest cycle in a graph.read more
References
More filters
Journal ArticleDOI
A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs
TL;DR: A method of finding every cycle of an undirected linear graph by computation, rather than search, is presented.
Journal ArticleDOI
A Cycle Generation Algorithm for Finite Undirected Linear Graphs
TL;DR: A modified version of Welch's Algorithm 3 is presented and the reasons for modifying Welch's algorithms are presented with examples.
Related Papers (5)
Near-optimal tension parameters in convexity preserving interpolation by generalized cubic splines
V. V. Bogdanov,Yuriy S. Volkov +1 more