Title of article

On computing minimum (s,t)-cuts in digraphs

Author/Authors

Hiroshi Nagamochi، نويسنده ,

Issue Information

دوهفته نامه با شماره پیاپی سال 2005

Pages

7

From page

231

To page

237

Keywords

graph algorithms , edge connectivity , Minimum cuts , Sparsification , Digraphs , Maximum flows

Journal title

Information Processing Letters

Serial Year

2005

Journal title

Information Processing Letters

Record number

130039