Partitions and network reliability

DOI10.1016/S0166-218X(99)00092-XMaRDI QIDQ1302179zbMATH OpenFDO

Authors Peter Tittmann

Publication date 22 September 1999

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

Full work available at URL https://doi.org/10.1016/S0166-218X(99)00092-X

zbMATH Keywords

\(K\)-terminal reliabilityall-terminal reliability

Mathematics Subject Classification ID

Partitions of sets (05A18) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Cut-Set Intersections and Node Partitions
• Network reliability
• Some Lattice-Theoretic Tools for Network Reliability Analysis
• Generalized activities and K-terminal reliability. II

Cited in

(12)

• Generalized activities and K-terminal reliability. II
• A note on the bounded fragmentation property and its applications in network reliability
• Greedy splitting algorithms for approximating multiway partition problems
• On generalized greedy splitting algorithms for multiway partition problems
• Reliability-Equivalent-Separation of a Node
• Cut-Set Intersections and Node Partitions
• Some Lattice-Theoretic Tools for Network Reliability Analysis
• scientific article; zbMATH DE number 15161 (Why is no real title available?)
• IEEE Trans. Reliab.,
• VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY
• Path survival reliabilities as measures of reliability for lifeline utility networks
• Factorization of network reliability with perfect nodes. II: Connectivity matrix

This page was built for publication: Partitions and network reliability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1302179)