The Complexity of the Residual Node Connectedness Reliability Problem (Q3204046)

From MaRDI portal
Revision as of 04:23, 2 September 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
The Complexity of the Residual Node Connectedness Reliability Problem
scientific article

    Statements

    The Complexity of the Residual Node Connectedness Reliability Problem (English)
    0 references
    0 references
    0 references
    0 references
    1991
    0 references
    planar graphs
    0 references
    {\#}P-completeness
    0 references
    network reliability
    0 references
    bipartite graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references