Item Details

Print View

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 Not EvaluatedCopyright Not Evaluated
Technical Details
  • Staff View

    LEADER 01609cam a2200361 4500
    001 100697379
    003 MiAaHDL
    005 20150526000000.0
    006 m d
    007 cr bn ---auaua
    008 741212 1970 eng u
    035
      
      
    a| sdr-uiuc207336
    035
      
      
    9| AAV-9597
    035
      
      
    a| (OCoLC)1108528
    040
      
      
    c| NAM d| UIU d| m.c.3
    100
    1
    0
    a| Chase, Stephen Martin, d| 1943-
    245
    1
    0
    a| Analysis of algorithms for finding all spanning trees of a graph.
    260
    0
      
    a| Urbana, b| Dept. of Computer Science, University of Illinois, c| 1970.
    300
      
      
    a| v, 63 p. b| illus. c| 28 cm.
    490
      
    0
    a| Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) v| no. 401
    500
      
      
    a| "Supported in part by the following grants: US NSF GJ 217, US NSF GJ 812, and project BUILD."
    500
      
      
    a| Thesis--University of Illinois.
    504
      
      
    a| Bibliography: p. 43-47.
    538
      
      
    a| Mode of access: Internet.
    650
      
    0
    a| Algorithms
    974
      
      
    8| 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
▾See more
▴See less

Access online

Google Preview

Google Books Preview