Factoring Algorithms for Computing K-Terminal Network Reliability
From MaRDI portal
Publication:3738893
DOI10.1109/TR.1986.4335431zbMath0602.90064MaRDI QIDQ3738893
Publication date: 1986
Published in: IEEE Transactions on Reliability (Search for Journal in Brave)
network reliabilityfactoring algorithmedge failureK-terminal reliabilityreliability-preserving reductionspivotal decomposition
Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)
Related Items (11)
Sixty years of network reliability ⋮ The computational complexity of the reliability problem on distributed systems ⋮ Reliability optimization of distributed computing systems subject to capacity constraints ⋮ A heuristic approach to generating file spanning trees for reliability analysis of distributed computing systems ⋮ Reliability and cost optimization in distributed computing systems. ⋮ A new simulation method based on the RVR principle for the rare event network reliability problem ⋮ The distributed program reliability analysis on ring-type topologies ⋮ Tele-network design based on queue competition algorithm ⋮ Accurate and Interval Estimates of the Probability of Network Service Availability for Communication Networks ⋮ The expected number of pairs of connected nodes: Pair-connected reliability ⋮ Optimal task allocation and hardware redundancy policies in distributed computing systems
This page was built for publication: Factoring Algorithms for Computing K-Terminal Network Reliability
