Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem (Q5891346)

From MaRDI portal
Revision as of 19:42, 7 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6234169
Language Label Description Also known as
English
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
scientific article; zbMATH DE number 6234169

    Statements

    Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 November 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    non-sparse graph classes
    0 references
    constant-factor approximation algorithm for cographs
    0 references
    linear-time algorithm for chordal cographs
    0 references
    spanning tree congestion
    0 references