000 00376 a2200121 4500
035 _a
090 _c24754
_d24754
100 _aRamachandran, V
245 _aThe complexity of minimum cut and maximum flow problems in an acyclic network
_c V. Ramachandran
260 _aBerkeley
_bMathematical Sciences Research Institute
_c1985
300 _a9 p
_c29 cm
942 _aIMAR
_cCART
_sSN
999 _c24464
_d24464