Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2010.07.017 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2010.07.017 / rank | |||
Normal rank | |||
Revision as of 04:11, 9 December 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+\epsilon})\) time |
scientific article |
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 references
