Ramachandran, V <br/><br/>
The complexity of minimum cut and maximum flow problems in an acyclic network 
V. Ramachandran 
 - Berkeley  Mathematical Sciences Research Institute  1985 
 - 9 p  29 cm