Computing residual connectedness reliability for restricted networks
DOI10.1016/0166-218X(93)90233-EzbMATH Open0780.90047OpenAlexW2066629848MaRDI QIDQ686266FDOQ686266
A. Satyanarayana, K. Sutner, Charles J. Colbourn, Charles L. Suffel
Publication date: 28 November 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(93)90233-e
Recommendations
connected graphpolynomial time algorithmsprobabilistic networkreliability measureresidual node connectedness reliability
Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25) Abstract computational complexity for mathematical programming problems (90C60) Connectivity (05C40) Stochastic network models in operations research (90B15) Communication networks in operations research (90B18)
Cites Work
- Complement reducible graphs
- The Complexity of Enumeration and Reliability Problems
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Steiner trees, partial 2–trees, and minimum IFI networks
- The Complexity of Reliability Computations in Planar and Acyclic Graphs
- A recognition algorithm for the intersection graphs of directed paths in directed trees
- A Linear Recognition Algorithm for Cographs
- Finding minimum dominating cycles in permutation graphs
- Domination in permutation graphs
- The Complexity of the Residual Node Connectedness Reliability Problem
- Efficient algorithms for computing the reliability of permutation and interval graphs
- Permutation graphs: Connected domination and Steiner trees
- Computing 2-terminal reliability for radio-broadcast networks
Cited In (15)
- On the Mean Connected Induced Subgraph Order of Cographs
- Maximal intervals of decrease and inflection points for node reliability
- The Complexity of the Residual Node Connectedness Reliability Problem
- Efficient algorithms for computing the reliability of permutation and interval graphs
- The shape of node reliability
- Splitting formulas for computing connectedness probability of undirected graphs
- A survey of some network reliability analysis and synthesis results
- A linear-time algorithm to compute the reliability of planar cube-free networks
- Title not available (Why is that?)
- Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots
- Residual reliability of P-threshold graphs
- Title not available (Why is that?)
- A polynomial-time algorithm for computing \(K\)-terminal residual reliability of \(d\)-trapezoid graphs
- Computing diameter constrained reliability of a network with junction points
- Computing optimal assignments for residual network reliability
This page was built for publication: Computing residual connectedness reliability for restricted networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686266)
