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
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Hisao Tamaki / rank
Normal rank
 
Property / author
 
Property / author: Hisao Tamaki / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_99 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2170677738 / rank
 
Normal rank

Latest revision as of 01:28, 20 March 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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references