ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS (Q2929622)

From MaRDI portal
Revision as of 09:12, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS
scientific article

    Statements

    ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS (English)
    0 references
    0 references
    0 references
    14 November 2014
    0 references
    graph algorithms
    0 references
    three-edge-connected graph
    0 references
    three-vertex-connected graph
    0 references
    cut pair
    0 references
    depth-first search
    0 references
    sparse spanning subgraph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references