Linear-time algorithms for computing the reliability of bipartite and (\(\# \leqslant 2\)) star distributed computing systems.

DOI10.1016/S0305-0548(02)00100-4zbMath1043.68027MaRDI QIDQ1422361

Min-Sheng Lin

Publication date: 14 February 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

algorithmsReliability\(\# P\)-completeDistributed computing systemsLinear-time

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Reliability and life testing (62N05)

Related Items (1)

Computing the \(K\)-terminal reliability of directed path graphs

Cites Work

• The computational complexity of the reliability problem on distributed systems
• The disributed program reliability analysis on star topologies
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Distributed program reliability analysis
• The Complexity of Enumeration and Reliability Problems

This page was built for publication: Linear-time algorithms for computing the reliability of bipartite and (\(\# \leqslant 2\)) star distributed computing systems.