Counting almost minimum cutsets with reliability applications (Q3768663)

From MaRDI portal
Revision as of 00:24, 19 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
Counting almost minimum cutsets with reliability applications
scientific article

    Statements

    Counting almost minimum cutsets with reliability applications (English)
    0 references
    0 references
    0 references
    0 references
    1987
    0 references
    0 references
    0 references
    0 references
    0 references
    probabilistic graph
    0 references
    network reliability
    0 references
    inclusion-exclusion
    0 references
    network cutsets in a graph
    0 references
    minimum cardinality network cutsets
    0 references
    polynomial time algorithm
    0 references
    edge-weighted graph
    0 references
    reliability bounds
    0 references