On algorithms for finding all circuits of a graph

Bibliography: p. [37]-[39]

Analysis of algorithms for finding all spanning trees of a graph.

"Supported in part by the following grants: US NSF GJ 217, US NSF GJ 812, and project BUILD."

Studies in graph algorithms : generation and labeling problems /

Thesis--Illinois.

Parallel algorithms for network routing problems and recurrences /

"Grant no. US NSF MCS75-21758."

Average analysis of simple path algorithms /

"UILU-ENG 77 1759."

An NP-complete matching problem /

"UILU-ENG 79-1713."