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

From MaRDI portal
Revision as of 20:24, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)

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
    0 references