Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs (Q2945193)

From MaRDI portal
Revision as of 22:38, 23 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Item:Q2945193
scientific article
Language Label Description Also known as
English
Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs
scientific article

    Statements

    Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs (English)
    0 references
    0 references
    0 references
    9 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    branch-/tree-decompositions
    0 references
    grid minor
    0 references
    planar graphs
    0 references
    approximation algorithm
    0 references