Computing residual connectedness reliability for restricted networks
From MaRDI portal
Publication:686266
DOI10.1016/0166-218X(93)90233-EzbMath0780.90047MaRDI QIDQ686266
Charles J. Colbourn, Charles L. Suffel, Klaus Sutner, A. Satyanarayana
Publication date: 28 November 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
connected graph; polynomial time algorithms; probabilistic network; reliability measure; residual node connectedness reliability
90C35: Programming involving graphs or networks
90C60: Abstract computational complexity for mathematical programming problems
90B18: Communication networks in operations research
90B15: Stochastic network models in operations research
90B25: Reliability, availability, maintenance, inspection in operations research
05C40: Connectivity
Related Items
Residual reliability of P-threshold graphs, Computing optimal assignments for residual network reliability, A survey of some network reliability analysis and synthesis results
Cites Work
- Finding minimum dominating cycles in permutation graphs
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Complement reducible graphs
- Permutation graphs: Connected domination and Steiner trees
- A recognition algorithm for the intersection graphs of directed paths in directed trees
- Computing 2-terminal reliability for radio-broadcast networks
- The Complexity of the Residual Node Connectedness Reliability Problem
- Efficient algorithms for computing the reliability of permutation and interval graphs
- Steiner trees, partial 2–trees, and minimum IFI networks
- A Linear Recognition Algorithm for Cographs
- Domination in permutation graphs
- The Complexity of Reliability Computations in Planar and Acyclic Graphs
- The Complexity of Enumeration and Reliability Problems
