TY  - BOOK
AU  - Balas Egon
AU  - Samuelsson Haakon
TI  - Finding a minimum node cover in an arbitrary graph
U1  - 658.57 
PY  - 1973///
CY  - Pittsburgh
PB  - C I T
KW  - Arbitrary graph
ER  -