Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q6827655)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6479934
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
