The computational complexity of the reliability problem on distributed systems

DOI10.1016/S0020-0190(97)00150-6zbMath1337.68043MaRDI QIDQ287259

Deng-Jyi Chen, Min-Sheng Lin

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

computational complexitydistributed systemsgraph theorydistributed program reliability

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (4)

The impact of overload conditions on computer network reliability ⋮ A hybrid vendor managed inventory and redundancy allocation optimization problem in supply chain management: an NSGA-II with tuned parameters ⋮ Multi-objective task allocation in distributed computing systems by hybrid particle swarm optimization ⋮ Linear-time algorithms for computing the reliability of bipartite and (\(\# \leqslant 2\)) star distributed computing systems.

Cites Work

• Unnamed Item
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Distributed program reliability analysis
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• Factoring Algorithms for Computing K-Terminal Network Reliability
• The Complexity of Reliability Computations in Planar and Acyclic Graphs
• Steiner problem in networks: A survey
• The Complexity of Enumeration and Reliability Problems
• Reliability Evaluation in Computer-Communication Networks
• A New Algorithm for the Reliability Analysis of Multi-Terminal Networks
• Reliability covering problems

This page was built for publication: The computational complexity of the reliability problem on distributed systems