Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem (Q3186492)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem |
scientific article |
Statements
Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem (English)
0 references
10 August 2016
0 references
sparsest-cut
0 references
maximum concurrent flow
0 references
planar graphs
0 references
max-cut
0 references
0 references
0 references
