Key points are not available for this paper at this time.
Abstract An algorithm for finding rings in graphs is presented. The algorithm is based on the Welch‐Assembly‐Gibbs algorithm of Wipke and Dyott but using the homeomorphically reduced pruned graph (the extension of HRG of Balaban et al). The algorithm is able to generate both the fundamental set of rings and all possible rings in a given graph. The time and storage needs are superior to both underlying algorithms. The CPU times of the old and new algorithms are given.
Luděk Matyska (Fri,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: