| Record ID | marc_loc_2016/BooksAll.2016.part09.utf8:153682314:831 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_2016/BooksAll.2016.part09.utf8:153682314:831?format=raw |
LEADER: 00831cam a2200217 i 4500
001 75621755
003 DLC
005 20130410082108.0
008 750717s1974 ilu b 000 0 eng
010 $a 75621755
040 $aDLC$cDLC$dDLC
050 00 $aQA76$b.I4 no. 691$aQA166.2
082 00 $a001.6/4/08 s$a511/.5
100 1 $aYao, Andrew Chi-Chih.
245 13 $aAn O(/E/loglog/V/) algorithm for finding minimum spanning trees /$cAndrew Chi-chih Yao.
260 $aUrbana :$bDept. of Computer Science, University of Illinois at Urbana-Champaign,$c1974.
300 $a6 leaves ;$c28 cm.
490 1 $a[Report] - UIUCDCS-R-74 ; 691
504 $aIncludes bibliographical references.
650 0 $aTrees (Graph theory)$xData processing.
810 1 $aIllinois.$bUniversity at Urbana-Champaign.$bDepartment of Computer Science.$tReport ;$v691.