000 00514nam a2200169Ia 4500
008 131223s9999 xx 000 0 und d
040 _aISI KOLKATA
041 _aEnglish
082 _a658.57
_bC289(325)
100 _aBalas Egon
245 _aFinding a minimum node cover in an arbitrary graph
260 _aPittsburgh
_bC I T
_c1973
440 _aCarnegie Institute of Technology: Management Science Research Report; NO. 325
650 _aArbitrary graph
700 _aSamuelsson Haakon
_4Auth.
942 _cBK
999 _c81179
_d81179