An exponential lower bound for cut sparsifiers in planar graphs (Q2324242)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exponential lower bound for cut sparsifiers in planar graphs |
scientific article |
Statements
An exponential lower bound for cut sparsifiers in planar graphs (English)
0 references
10 September 2019
0 references
mimicking network
0 references
planar graph
0 references
sparsifier
0 references
0 references
