On finding two-connected subgraphs in planar graphs (Q1376267)

From MaRDI portal
Revision as of 20:47, 19 July 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
On finding two-connected subgraphs in planar graphs
scientific article

    Statements

    On finding two-connected subgraphs in planar graphs (English)
    0 references
    0 references
    17 December 1997
    0 references
    0 references
    network survivability
    0 references
    Steiner tree
    0 references
    design of reliable networks
    0 references
    minimum-weight 2-connected subgraph
    0 references
    planar graph
    0 references
    polynomial-time algorithm
    0 references