Lower bounds on two-terminal network reliability

DOI10.1016/0166-218X(88)90065-0zbMath0665.90036MaRDI QIDQ1116878

Timothy B. Brecht, Charles J. Colbourn

Publication date: 1988

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

lower boundsnetwork reliabilityconnection probabilitytwo-terminal reliabilityprobabilistic networkedge- disjoint pathsKruskal-Katona boundstopological design

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items

Sixty years of network reliability, Practical sequential bounds for approximating two-terminal reliability, Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate, Edge-packings of graphs and network reliability, Lower bounds on two-terminal network reliability, Routing scheme of a multi-state computer network employing a retransmission mechanism within a time threshold, Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks, Counting almost minimum cutsets with reliability applications, A practical bounding algorithm for computing two-terminal reliability based on decomposition technique, Stochastic flow networks via multiple paths under time threshold and budget constraint, Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network, A novel algorithm on network reliability estimation, Assessment of system reliability for a stochastic-flow distribution network with the spoilage property, Expected value expansions in rooted graphs, Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks, High-confidence estimation of small s -t reliabilities in directed acyclic networks, Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints, Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability, Analysis and synthesis problems for network resilience, Spare Reliability for Capacitated Computer Networks Under Tolerable Error Rate and Latency Considerations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new short proof for the Kruskal-Katona theorem
• Lower bounds on two-terminal network reliability
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Multi-Component Systems and Structures and Their Reliability
• Bounds on expected performance of networks with links subject to failure
• Calculating bounds on reachability and connectedness in stochastic networks
• First-and second-order bounds on terminal reliability
• The Complexity of Enumeration and Reliability Problems
• A recursive algorithm for finding reliability measures related to the connection of nodes in a graph
• Polynomial algorithms for estimating network reliability
• Computing the Reliability of Complex Networks
• Sequential Bounding of the Reliability of a Stochastic Network
• The complexity of finding maximum disjoint paths with length constraints
• Coherent Structures of Non-Identical Components
• Network reliability analysis: Part I
• Reliable circuits using less reliable relays