Item Details
Analysis of Algorithms for Finding All Spanning Trees of a Graph
Chase, Stephen Martin
- Format
- Book; Online; EBook
- Published
- Urbana, Dept. of Computer Science, University of Illinois, 1970.
- Language
- English
- Series
- Report (University of Illinois at Urbana-Champaign. Dept. Of Computer Science)
- Description
- v, 63 p. illus. 28 cm.
- Mode of access: Internet.
- Notes
- "Supported in part by the following grants: US NSF GJ 217, US NSF GJ 812, and project BUILD."
- Thesis--University of Illinois.
- Bibliography: p. 43-47.
- Series Statement
- Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) no. 401
- Copyright & PermissionsRights statements and licenses provide information about copyright and reuse associated with individual items in the collection.
Copyright Not Evaluated
- Technical Details
-
- Staff View
LEADER 01609cam a2200361 4500001 100697379003 MiAaHDL005 20150526000000.0006 m d007 cr bn ---auaua008 741212 1970 eng ua| sdr-uiuc2073369| AAV-9597a| (OCoLC)1108528c| NAM d| UIU d| m.c.3a| Chase, Stephen Martin, d| 1943-a| Analysis of algorithms for finding all spanning trees of a graph.a| Urbana, b| Dept. of Computer Science, University of Illinois, c| 1970.a| v, 63 p. b| illus. c| 28 cm.a| Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) v| no. 401a| "Supported in part by the following grants: US NSF GJ 217, US NSF GJ 812, and project BUILD."a| Thesis--University of Illinois.a| Bibliography: p. 43-47.a| Mode of access: Internet.a| Algorithms8| ia.analysisofalgori401chas b| UIU c| IUIUC d| 20180315 s| ia u| uiuo.ark:/13960/t4hm6qm37 z| Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) no. 401 y| 1970 r| cc-by-nc-sa-3.0 q| con
- Staff View