Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs (Q5252687)
From MaRDI portal
scientific article; zbMATH DE number 6442171
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs |
scientific article; zbMATH DE number 6442171 |
Statements
Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs (English)
0 references
2 June 2015
0 references
minimum cut
0 references
maximum flow random graph
0 references
random sampling
0 references
connectivity
0 references
cut enumeration
0 references
network reliability
0 references
0 references
0 references
0 references
0 references
