Analysis of algorithms for finding all spanning trees of a graph
Series: Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) -- no. 401; Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) -- no. 401
Publisher: Dept. of Computer Science, University of Illinois
Published: 1970
Place of publication: Urbana
Language: eng
Number of pages: 63
Subjects: Algorithms
Notes: Thesis--University of Illinois.

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

Bibliography: p. 43-47.