On computing minimum (<i>s, t</i>)-cuts in digraphs.

Hiroshi Nagamochi On computing minimum (<i>s, t</i>)-cuts in digraphs. 231-237 2005 93 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.11.006 db/journals/ipl/ipl93.html#Nagamochi05