A note on bounding \(k\)-terminal reliability
From MaRDI portal
Publication:1186804
DOI10.1007/BF01758764zbMath0751.05079MaRDI QIDQ1186804
Publication date: 28 June 1992
Published in: Algorithmica (Search for Journal in Brave)
05C05: Trees
05C80: Random graphs (graph-theoretic aspects)
68M10: Network design and communication in computer systems
90B25: Reliability, availability, maintenance, inspection in operations research
Cites Work
- Edge-packings of graphs and network reliability
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Multi-Terminal Network Flows
- The Complexity of Enumeration and Reliability Problems
- Series-Parallel Bounds for the Two-Terminal Reliability Problem
- Bounds on the Reliability Polynomial for Shellable Independence Systems
- Reducibility among Combinatorial Problems
- Unnamed Item
- Unnamed Item