The Complexity of the Residual Node Connectedness Reliability Problem
From MaRDI portal
Publication:3204046
DOI10.1137/0220009zbMath0716.68049OpenAlexW2093187872MaRDI QIDQ3204046
Klaus Sutner, A. Satyanarayana, Charles L. Suffel
Publication date: 1991
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0220009
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)
Related Items (11)
Maximal intervals of decrease and inflection points for node reliability ⋮ Computing optimal assignments for residual network reliability ⋮ Uniformly optimally reliable graphs: A survey ⋮ Extremal problems for connected set enumeration ⋮ Existence of optimally‐greatest digraphs for strongly connected node reliability ⋮ The shape of node reliability ⋮ A polynomial-time algorithm for computing \(K\)-terminal residual reliability of \(d\)-trapezoid graphs ⋮ Computing residual connectedness reliability for restricted networks ⋮ Residual reliability of P-threshold graphs ⋮ A survey of some network reliability analysis and synthesis results ⋮ On the Mean Connected Induced Subgraph Order of Cographs
This page was built for publication: The Complexity of the Residual Node Connectedness Reliability Problem
