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
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 06:25, 5 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
    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