Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time (Q3652285): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q284333 |
Changed an Item |
||
| Property / author | |||
| Property / author: Hisao Tamaki / rank | |||
Normal rank | |||
Revision as of 08:24, 12 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time |
scientific article |
Statements
Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time (English)
0 references
17 December 2009
0 references
constant-factor approximation algorithms
0 references
graph algorithms
0 references
optimal branch-decompositions
0 references
largest grid graph minors
0 references
