The Complexity of the Residual Node Connectedness Reliability Problem
- 1 February 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 20 (1) , 149-155
- https://doi.org/10.1137/0220009
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Computing residual connectedness reliability for restricted networksDiscrete Applied Mathematics, 1993
- Efficient algorithms for computing the reliability of permutation and interval graphsNetworks, 1990
- The Complexity of Reliability Computations in Planar and Acyclic GraphsSIAM Journal on Computing, 1986
- A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel NetworksSIAM Journal on Computing, 1985
- Planar Formulae and Their UsesSIAM Journal on Computing, 1982
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979