Degree-based approximations for network reliability polynomials
From MaRDI portal
Cites work
- A decomposition algorithm for network reliability evaluation
- A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
- A Monte Carlo Sampling Plan for Estimating Network Reliability
- A Reliability Bound for Systems of Maintained, Interdependent Components
- Complexity of network reliability computations
- Computational Complexity of Network Reliability Analysis: An Overview
- Enumeration Of Labelled Graphs
- Fast computation of bounds for two-terminal network reliability
- Graph Spectra for Complex Networks
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 49666 (Why is no real title available?)
- scientific article; zbMATH DE number 3308309 (Why is no real title available?)
- Network reliability: Heading out on the highway
- New approximations for network reliability
- Performance Analysis of Complex Networks and Systems
- Reliable circuits using less reliable relays
- Sixty years of network reliability
- The asymptotic behavior of queueing systems: Large deviations theory and dominant pole approximation
- The birth of the giant component
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
This page was built for publication: Degree-based approximations for network reliability polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6903291)