New hardness results for planar graph problems in p and an algorithm for sparsest cut (Q5144984)
From MaRDI portal
scientific article; zbMATH DE number 7298305
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New hardness results for planar graph problems in p and an algorithm for sparsest cut |
scientific article; zbMATH DE number 7298305 |
Statements
New hardness results for planar graph problems in p and an algorithm for sparsest cut (English)
0 references
19 January 2021
0 references
algorithm
0 references
planar graphs
0 references
sparsest cut
0 references
