Computing residual connectedness reliability for restricted networks

DOI10.1016/0166-218X(93)90233-EMaRDI QIDQ686266zbMATH OpenOpenAlexFDO

Authors Charles J. Colbourn, A. Satyanarayana, Charles L. Suffel, K. Sutner

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

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

Recommendations

• The Complexity of the Residual Node Connectedness Reliability Problem
• scientific article; zbMATH DE number 176250
• scientific article; zbMATH DE number 1145911
• scientific article; zbMATH DE number 139921
• scientific article; zbMATH DE number 4187439

Cites work

• A Linear Recognition Algorithm for Cographs
• A recognition algorithm for the intersection graphs of directed paths in directed trees
• Complement reducible graphs
• Computing 2-terminal reliability for radio-broadcast networks
• Domination in permutation graphs
• Efficient algorithms for computing the reliability of permutation and interval graphs
• Finding minimum dominating cycles in permutation graphs
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• Permutation graphs: Connected domination and Steiner trees
• Steiner trees, partial 2–trees, and minimum IFI networks
• The Complexity of Enumeration and Reliability Problems
• The Complexity of Reliability Computations in Planar and Acyclic Graphs
• The Complexity of the Residual Node Connectedness Reliability Problem

Cited in

(18)

• Computing optimal assignments for residual network reliability
• The shape of node reliability
• A survey of some network reliability analysis and synthesis results
• The Complexity of the Residual Node Connectedness Reliability Problem
• Efficient algorithms for computing the reliability of permutation and interval graphs
• Splitting formulas for computing connectedness probability of undirected graphs
• A linear-time algorithm to compute the reliability of planar cube-free networks
• Resilience of partialk-tree networks with edge and node failures
• scientific article; zbMATH DE number 1145911 (Why is no real title available?)
• scientific article; zbMATH DE number 1979494 (Why is no real title available?)
• On the mean connected induced subgraph order of cographs
• A polynomial-time algorithm for computing \(K\)-terminal residual reliability of \(d\)-trapezoid graphs
• The intractability of the reliable assignment problem in split networks
• Residual reliability of P-threshold graphs
• scientific article; zbMATH DE number 4187439 (Why is no real title available?)
• Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots
• Computing diameter constrained reliability of a network with junction points
• Maximal intervals of decrease and inflection points for node 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)