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