| Record ID | marc_loc_2016/BooksAll.2016.part19.utf8:7180056:1041 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_2016/BooksAll.2016.part19.utf8:7180056:1041?format=raw |
LEADER: 01041cam a2200265 a 4500
001 88156495
003 DLC
005 19920625144914.5
008 880630s1987 ge b 00010 eng c
010 $a 88156495 //r92
040 $aMiU$cMiU$dDLC
041 0 $aeng$bgerrus
050 14 $aQA267$b.S34x 1987
100 10 $aScheffler, Petra.
245 10 $aLinear-time algorithms for NP-complete problems restricted to partial k-trees /$cPetra Scheffler ; communicated by B. Goetze.
260 0 $aBerlin :$bAkademie der Wissenschaften der DDR, Karl-Weierstrass-Institut für Mathematik,$c1987.
300 $a48 p. ;$c21 cm.
490 1 $aReport / Akademie der Wissenschaften der DDR, Karl-Weierstrass-Institut für Mathematik,$x0233-2876 ;$vR-MATH-03/87
500 $aSummary in English, German and Russian.
504 $aBibliography: p. 48.
650 0 $aNP-complete problems.
650 0 $aGraph theory.
650 0 $aAlgorithms.
650 0 $aTrees (Graph theory)
830 0 $aReport (Karl-Weierstrass-Institut für Mathematik) ;$vR-Math-87/03.