Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract) (Q3652304)

From MaRDI portal
Revision as of 12:50, 17 October 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-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)
scientific article

    Statements

    Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 December 2009
    0 references
    two-vertex connectivity augmentation problem
    0 references
    linear time algorithm
    0 references

    Identifiers