*001250865
*00520250613134738.0
*007ta
*008101022s1993    no            000 0 eng
*00901119cam a2200265 c 4500
*019  $bl
*035  $a(EXLNZ-47BIBSYS_NETWORK)999315928604702201
*035  $a(NO-LaBS)14129672(bibid)
*035  $a(NO-TrBIB)931592860
*035  $a931592860-47bibsys_network
*040  $aNO-OsNB$bnob$ekatreg
*080  $a519.17-37
*1001 $aAspvall, Bengt$0(NO-TrBIB)90366072$_50841800
*24510$aFinding minimum height elimination trees for interval graphs in polynomial time$cBengt Aspvall, Pinar Heggernes
*260  $aBergen$bDepartment of Informatics, University of Bergen$c1993
*300  $a31 s.$bfig.
*4901 $aReports in informatics$vno. 80
*533  $aElektronisk reproduksjon$b[Norge]$cNasjonalbiblioteket Digital$d2017-01-25
*650 7$aGrafteori$xDatabehandling$2tekord$_188421200
*653  $aeliminasjons-trær$aalgoritmer$aintervall-grafer$_50841900
*7001 $aHeggernes, Pinar$0(NO-TrBIB)90594495$_49330600
*830 0$aReports in informatics (trykt utg.)$x0333-3590$vno. 80$w998711258704702201$_14253500
*85641$3Fulltekst$uhttps://urn.nb.no/URN:NBN:no-nb_digibok_2017012548127$yNettbiblioteket$zDigital representasjon
*901  $a80
*999  $aoai:nb.bibsys.no:999315928604702202$b2021-11-14T20:03:30Z$z999315928604702202
^