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

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/j.dam.2006.04.017 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2006.04.017 / rank
 
Normal rank

Latest revision as of 05:50, 10 December 2024

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