The complexity of computing the 2-K-reliability in networks (Q2448852)

From MaRDI portal
Revision as of 12:19, 8 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
The complexity of computing the 2-K-reliability in networks
scientific article

    Statements

    The complexity of computing the 2-K-reliability in networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 May 2014
    0 references
    network reliability
    0 references
    survivability
    0 references
    fault tolerance
    0 references
    diameter constraints
    0 references
    combinatorial problems
    0 references
    computational complexity
    0 references

    Identifiers

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