Computing residual connectedness reliability for restricted networks

DOI10.1016/0166-218X(93)90233-EzbMath0780.90047OpenAlexW2066629848MaRDI QIDQ686266

A. Satyanarayana, Charles J. Colbourn, Klaus Sutner, 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

zbMATH Keywords

connected graphpolynomial time algorithmsprobabilistic networkreliability measureresidual node connectedness reliability

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18) Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25) Connectivity (05C40)

Related Items (8)

Maximal intervals of decrease and inflection points for node reliability ⋮ Computing optimal assignments for residual network reliability ⋮ Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots ⋮ The shape of node reliability ⋮ A polynomial-time algorithm for computing \(K\)-terminal residual reliability of \(d\)-trapezoid graphs ⋮ 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

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

This page was built for publication: Computing residual connectedness reliability for restricted networks