On computing minimum\((s,t)\)-cuts in digraphs (Q835038)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On computing minimum\((s,t)\)-cuts in digraphs |
scientific article; zbMATH DE number 5599211
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On computing minimum\((s,t)\)-cuts in digraphs |
scientific article; zbMATH DE number 5599211 |
Statements
On computing minimum\((s,t)\)-cuts in digraphs (English)
0 references
27 August 2009
0 references
graph algorithms
0 references
edge connectivity
0 references
minimum cuts
0 references
maximum flows
0 references
sparsification
0 references
digraphs
0 references
0 references
