A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs (Q3569129)

From MaRDI portal
Revision as of 01:45, 13 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs
scientific article

    Statements

    A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs (English)
    0 references
    0 references
    0 references
    17 June 2010
    0 references
    0 references
    spanning caterpillars
    0 references
    treewidth
    0 references
    networks topology
    0 references
    optimization
    0 references