*001688659
*00520250613140302.0
*007ta
*008101022s1995    no            000 u eng
*00901213cam a2200289 c 4500
*019  $bl
*035  $a(EXLNZ-47BIBSYS_NETWORK)999521523124702201
*035  $a(NO-LaBS)14797426(bibid)
*035  $a(NO-TrBIB)952152312
*035  $a952152312-47bibsys_network
*040  $aNO-OsNB$bnob$ekatreg
*080  $a519.17-37
*1001 $aAspvall, Bengt$0(NO-TrBIB)90366072$_50841800
*24512$aA simple cubic algorithm for computing minimum height elimination trees for interval graphs$cBengt Aspvall, Pinar Heggernes, Jan Arne Telle
*260  $aBergen$bDepartment of Informatics, University of Bergen$c1995
*300  $a10 bl.
*4901 $aReports in informatics$vreport no. 103
*533  $aElektronisk reproduksjon$b[Norge]$cNasjonalbiblioteket Digital$d2017-04-10
*588  $aKatalogisert etter omslag
*650 7$aGrafteori$xDatabehandling$2tekord$_188421200
*653  $aGrafteori$_24483200
*7001 $aHeggernes, Pinar$0(NO-TrBIB)90594495$_49330600
*7001 $aTelle, Jan Arne$0(NO-TrBIB)90856584$_31391300
*830 0$aReports in informatics (trykt utg.)$x0333-3590$vreport no. 103$w998711258704702201$_14253500
*85641$3Fulltekst$uhttps://urn.nb.no/URN:NBN:no-nb_digibok_2017041048029$yNettbiblioteket$zDigital representasjon
*901  $a80
*999  $aoai:nb.bibsys.no:999521523124702202$b2021-11-14T20:42:05Z$z999521523124702202
^