An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633)

From MaRDI portal
Revision as of 05:10, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
scientific article

    Statements

    An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (English)
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    0 references
    connectivity augmentation
    0 references
    square-free 2-matching
    0 references
    jump system
    0 references
    subcubic graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references