An exponential lower bound for cut sparsifiers in planar graphs (Q5111883)
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: An exponential lower bound for cut sparsifiers in planar graphs |
scientific article; zbMATH DE number 7205208
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exponential lower bound for cut sparsifiers in planar graphs |
scientific article; zbMATH DE number 7205208 |
Statements
27 May 2020
0 references
mimicking networks
0 references
planar graphs
0 references
0 references
0.9971103072166444
0 references
0.8791722655296326
0 references
0.8606149554252625
0 references
0.8535855412483215
0 references
0.8453654646873474
0 references
