article · 1978
Circuit enumeration in an undirected graph
Cited by 3Open access
Abstract
In his paper J. T. Welch [7] presents an algorithm for determining the circuits of a graph in a mechanical manner. Unfortunately, when an implementation of this procedure was attempted by N. E. Gibbs a very large class of counter examples was discovered. Gibbs rectified this situation in his algorithm [1]. However, a close study of Gibbs' algorithm shows that it is essentially an enumerative case considering all possible combinations. Hsu and Honkanen [3] developed a set of algorithms which used Welch's Concept where it applied and then examined the remaining circuits essentially in a manner like Gibbs' algorithm but did not require examining all possible combinations. R. Tarjan [6] pointed out several flaws in these algorithms which are corrected in this paper.
Cite this paper
Honkanen, P. A. (1978). Circuit enumeration in an undirected graph. https://doi.org/10.1145/503643.503655
Honkanen, Pentti A. “Circuit enumeration in an undirected graph.” 1978, pp. 49–53, https://doi.org/10.1145/503643.503655.
Honkanen, Pentti A. 1978. “Circuit enumeration in an undirected graph.” https://doi.org/10.1145/503643.503655.
Honkanen, P.A. (1978) ‘Circuit enumeration in an undirected graph’. Available at: https://doi.org/10.1145/503643.503655.
@article{honkanen1978circuit,
title = {{Circuit enumeration in an undirected graph}},
author = {Honkanen, Pentti A.},
pages = {49--53},
year = {1978},
doi = {10.1145/503643.503655}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.