| Record ID | ia:oeloglogvalgorit691yaoa |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/oeloglogvalgorit691yaoa/oeloglogvalgorit691yaoa_marc.xml |
| Download MARC binary | https://www.archive.org/download/oeloglogvalgorit691yaoa/oeloglogvalgorit691yaoa_meta.mrc |
LEADER: 00911cam 2200217 i 4500
001 830162
005 20130304113412.0
008 750717s1974 ilu b 00010 engm
035 $a(OCoLC)ocm01552281
035 $9ADK-3390
040 $aDLC$cDLC$dm.c.$dUIU
050 0 $aQA76$b.I4 no. 691$aQA166.2
082 $a001.6/4/08 s$a511/.5
100 10 $aYao, Andrew Chi-Chih.
245 13 $aAn O(/E/loglog/V/) algorithm for finding minimum spanning trees /$cAndrew Chi-chih Yao.
260 0 $aUrbana, Illinois :$bDept. of Computer Science, University of Illinois at Urbana-Champaign,$c1974.
300 $a6 leaves ;$c28 cm.
440 0 $aReport (University of Illinois at Urbana-Champaign. Dept. of Computer Science)$vno. 691
504 $aIncludes bibliographical references.
650 0 $aTrees (Graph theory)$xData processing.
830 0 $aReport (University of Illinois at Urbana-Champaign. Dept. of Computer Science)$vno. 691.