Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n^1+) time |
scientific article; zbMATH DE number 5932526
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time |
scientific article; zbMATH DE number 5932526 |
Statements
Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (English)
0 references
27 July 2011
0 references
graph algorithms
0 references
branch-decompositions
0 references
graph minors
0 references
0 references
0 references
0.9989551901817322
0 references
0.8902521133422852
0 references
0.8740667700767517
0 references
