Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990)
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: Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem |
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
26 October 2018
0 references
sparsest cut
0 references
maximum concurrent flow
0 references
planar graphs
0 references
max-cut
0 references
0 references
0 references
