The Complexity of the Residual Node Connectedness Reliability Problem

  title={The Complexity of the Residual Node Connectedness Reliability Problem},
  author={Klaus Sutner and Appajosyula Satyanarayana and Charles L. Suffel},
  journal={SIAM J. Comput.},
This paper considers a probabilistic network in which the edges are perfectly reliable but the nodes fail with some known probabilities. The network is in an operational state if the surviving nodes induce a connected graph. The residual node connectedness reliability $R(G)$ of a network G is the probability that the graph induced by the surviving nodes is connected. This reliability measure is very different from the widely studied K-terminal network reliability measure. It is proven that the… Expand
Computing Residual Connectedness Reliability for Restricted Networks
Efficient algorithms for computing R(G) of various restricted classes of networks that admit polynomial time algorithms include trees, series-parallel graphs, partial k-trees, directed path graphs and permutation graphs are presented. Expand
A coherent model for reliability of multiprocessor networks
This paper proposes a new definition of network reliability that handles the case of node failures; it is coherent and determines many of its properties, and presents several analysis and synthesis results. Expand
On the roots of the node reliability polynomial
It is shown that the node reliability polynomial of any connected graph on at least three nodes has a nonreal polynometric root, the collection of real roots of all node reliabilityPolynomials is unbounded, and theCollection of complex roots of both real and complex roots is dense in the entire complex plane. Expand
Computing Optimal Assignments for Residual Network Reliability
This paper shows how optimal assignments can be found in polynomial time for paths, cycles, threshold graphs, and complete graphs minus a matching, and the problem is shown to be NP-hard even for complete bipartite graphs. Expand
A polynomial-time algorithm for computing K-terminal residual reliability of d-trapezoid graphs
An O ( max ? { n , k 2 } n 2 d ) -time algorithm for computing the K-terminal residual reliability of a d-trapezoid graph G, where n = | V ( G ) | and k = | K | . Expand
Reliability Polynomials of Networks with Vertex Failure
  • Haixing Zhao, Liang Wei
  • Mathematics, Computer Science
  • 2009 International Conference on Computational Intelligence and Security
  • 2009
The subgraph expression of reliability polynomial of a graph G, denoted by P_n(G, p), is given and it is shown that the induced subgraphs of surviving vertices connected are connected. Expand
Network reliability with node failures
Given a graph whose edges never fail but whose nodes fail independently of each other with a constant probability 1 − p, the reliability of a graph is defined to be the probability that the inducedExpand
On reliability of graphs with node failures
It is shown that most classes of sparse graphs do not contain a uniformly best graph and the important notions of locally best and asymptotically best graphs are introduced. Expand
The shape of node reliability
This work studies analytic properties of the node reliability on the interval [ 0 , 1 ] including monotonicity, concavity, and fixed points and shows a stark contrast between this model of network robustness and models that arise from coherent set systems. Expand
The intractability of the reliable assignment problem in split networks
It is shown that the Assignment Problem is computationally hard even for the restricted class of split networks, a generalization of threshold networks for which the problem is solvable in polynomial time. Expand


The Complexity of Reliability Computations in Planar and Acyclic Graphs
  • J. S. Provan
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1986
We show that the problem of computing source-sink reliability is NP-hard, in fact # P-complete, even for undirected and acyclic directed source-sink planar graphs having vertex degree at most three.Expand
Planar Formulae and Their Uses
Using these results, it is able to provide simple and nearly uniform proofs of NP-completeness for planar node cover, planar Hamiltonian circuit and line, geometric connected dominating set, and of polynomial space completeness forPlanar generalized geography. Expand
The Combinatorics of Network Reliability
The reliability polynominal Edge-disjoint subgraphs Additive and multiplicative improvements Combining the bounds The k-cycle bound Computational results References Index. Expand
The Complexity of Enumeration and Reliability Problems
  • L. Valiant
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1979
For a large number of natural counting problems for which there was no previous indication of intractability, that they belong to the class of computationally eqivalent counting problems that are at least as difficult as the NP-complete problems. Expand