Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs (Q2945193): Difference between revisions
From MaRDI portal
Item:Q2945193
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1407.6761 / rank | |||
Normal rank | |||
Revision as of 22:28, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs |
scientific article |
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
