A note on bounding \(k\)-terminal reliability

DOI10.1007/BF01758764zbMath0751.05079MaRDI QIDQ1186804

Charles J. Colbourn

Publication date: 28 June 1992

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

Steiner treereliability boundgraph transformation\(k\)-terminal reliability

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Reliability, availability, maintenance, inspection in operations research (90B25)

Cites Work

• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: A note on bounding \(k\)-terminal reliability