Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs (Q860392)

From MaRDI portal
Revision as of 00:33, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
scientific article

    Statements

    Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs (English)
    0 references
    0 references
    0 references
    9 January 2007
    0 references
    undirected graph
    0 references
    connectivity augmentation problem
    0 references
    local edge-connectivity
    0 references
    node-to-area connectivity
    0 references
    polynomial time deterministic algorithm
    0 references

    Identifiers

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