Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 05:27, 5 March 2024

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
    11 March 2019
    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