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

From MaRDI portal
Revision as of 19:40, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(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

    title
    The Complexity of the Residual Node Connectedness Reliability Problem (English)
    0 references
    author
    Klaus Sutner
    0 references
    A. Satyanarayana
    0 references
    Charles L. Suffel
    0 references
    publication date
    1991
    0 references
    zbMATH Keywords
    planar graphs
    0 references
    {\#}P-completeness
    0 references
    network reliability
    0 references
    bipartite graphs
    0 references

    Identifiers

    DOI
    10.1137/0220009
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68R10
    0 references
    68R05
    0 references
    zbMATH DE Number
    4180803
    0 references
    OpenAlex ID
    W2093187872
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3204046&oldid=31587097"
    Powered by MediaWiki