A Faster Algorithm for Finding the Minimum Cut in a Directed Graph (Q4314500)
From MaRDI portal
scientific article; zbMATH DE number 694903
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Faster Algorithm for Finding the Minimum Cut in a Directed Graph |
scientific article; zbMATH DE number 694903 |
Statements
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph (English)
0 references
14 December 1994
0 references
minimum capacity cut
0 references
directed network
0 references
