| Record ID | marc_loc_2016/BooksAll.2016.part12.utf8:130178991:914 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_2016/BooksAll.2016.part12.utf8:130178991:914?format=raw |
LEADER: 00914cam a2200253 i 4500
001 79624280
003 DLC
005 20130419101054.0
008 800312s1979 ilua b s000 0 eng
010 $a 79624280
040 $aDLC$cDLC$dDLC
050 00 $aQA76$b.I4 no. 967$aQA166
082 00 $a001.64 s$a511/.5
100 1 $aPlaisted, David A.
245 13 $aAn NP-complete matching problem /$cby David A. Plaisted.
260 $aUrbana :$bDept. of Computer Science, University of Illinois at Urbana-Champaign,$c1979.
300 $a11 p. :$bdiagr. ;$c28 cm.
490 1 $a[Report - UIUCDCS-R-79 ; 967
500 $a"UILU-ENG 79-1713."
504 $aBibliography: p. 11.
650 0 $aGraph theory$xData processing.
650 0 $aMatching theory$xData processing.
650 0 $aNP-complete problems$xData processing.
810 1 $aIllinois.$bUniversity at Urbana-Champaign.$bDepartment of Computer Science.$tReport ;$v967.