An efficient search algorithm to find the elementary circuits of a graph

Publisher Website

1 December 1970

journal article
research article
Published by Association for Computing Machinery (ACM) in Communications of the ACM

Vol. 13 (12), 722-726
https://doi.org/10.1145/362814.362819

Abstract

No abstract available

Keywords

This publication has 5 references indexed in Scilit:

An algorithm for finding a fundamental set of cycles of a graph
Communications of the ACM, 1969
On an asymptotic optimization problem in finite, directed, weighted graphs
Information and Control, 1968
Algorithms for finding a fundamental set of cycles for an undirected linear graph
Communications of the ACM, 1967
Systematic generation of Hamiltonian circuits
Communications of the ACM, 1966
A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs
Journal of the ACM, 1966

Cited by 147 articles