Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs (Q2945193): Difference between revisions
From MaRDI portal
Item:Q2945193
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
EloiFerrer (talk | contribs) Page moved from [mardi:Publication:2945193] to [mardi:Publication:1730234] |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:56, 2 May 2024
scientific article; zbMATH DE number 6479934
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs |
scientific article; zbMATH DE number 6479934 |
Statements
Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs (English)
0 references
9 September 2015
0 references
branch-/tree-decompositions
0 references
grid minor
0 references
planar graphs
0 references
approximation algorithm
0 references
