Options
Enumeration of all Circuits of a Graph
Date Issued
01-01-1969
Author(s)
Rao, Bapeswara
Murti, V. G.K.
Abstract
An algorithm is presented to enumerate all circuits of a linear graph. The method is suitable for computerization and does not require a large computer memory. The application of the procedure to some other enumeration problems is discussed. Copyright © 1969 by The Institute of Electrical and Electronics Engineers, Inc.
Volume
57