Circuit enumeration in an undirected graph


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… (More)
DOI: 10.1145/503643.503655

2 Figures and Tables


  • Presentations referencing similar topics