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.

On the ordering, enumeration and ranking of k-ary trees /

"UILU-ENG 77 1706."

Canonical simplification of finite objects, well quasi-ordered by tree embedding /

"UILU-ENG 79 1727."

Picture analysis by graph transformation,

"Supported in part by the Department of Computer Science and the Atomic Energy Commission under contract US AEC AT(11-1)2118."

Parallel algorithms for network routing problems and recurrences /

"Grant no. US NSF MCS75-21758."

Average analysis of simple path algorithms /

"UILU-ENG 77 1759."

Graph transformations for composite formation,

"C00-1018-1195."

A graph-structure transformation model for picture parsing,

"COO-2118-0031."

Pánta ta kat' exoch?n kaloumena Biblia Theias d?lad? Graph?s palaias te, kai neas = Sacrae scripturae veteris nouaéque omnia.

CCBE S. XVI,

Peri to O, hermēneutōn tēs Palaias Theias Graphēs vivlia 4.

Mode of access: Internet.

Unit graph and loss rate optimization : Hydrologic Engineering Center computer program 23-J2-L211.

At head of title : Generalized computer program.

Unit graph and hydrograph computation : Hydrologic Engineering Center computer program 23-J2-L228.

At head of cover title : Generalized computer program.

Comparison of the implicit enumeration method and the branch-and-bound method for logical design

Bibliography: p. 91-94.