Two-edge connected spanning subgraphs and polyhedra (Q1330901)

From MaRDI portal
Revision as of 22:00, 18 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
Two-edge connected spanning subgraphs and polyhedra
scientific article

    Statements

    Two-edge connected spanning subgraphs and polyhedra (English)
    0 references
    0 references
    10 August 1994
    0 references
    polyhedra
    0 references
    facets
    0 references
    series-parallel graphs
    0 references
    two-edge connected spanning subgraph of minimum weight
    0 references
    traveling salesman
    0 references
    design of reliable communication and transportation networks
    0 references

    Identifiers