Partitions and network reliability

DOI10.1016/S0166-218X(99)00092-XzbMath0947.68012MaRDI QIDQ1302179

Peter Tittmann

Publication date: 22 September 1999

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

zbMATH Keywords

all-terminal reliability\(K\)-terminal reliability

Mathematics Subject Classification ID

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

Related Items (3)

On generalized greedy splitting algorithms for multiway partition problems ⋮ VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY ⋮ Greedy splitting algorithms for approximating multiway partition problems

This page was built for publication: Partitions and network reliability