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 reliability; factoring algorithm; edge failure; K-terminal reliability; reliability-preserving reductions; pivotal decomposition
90B25: Reliability, availability, maintenance, inspection in operations research
90B10: Deterministic network models in operations research
Related Items
Tele-network design based on queue competition algorithm, Accurate and Interval Estimates of the Probability of Network Service Availability for Communication Networks, The distributed program reliability analysis on ring-type topologies, The computational complexity of the reliability problem on distributed systems, A heuristic approach to generating file spanning trees for reliability analysis of distributed computing systems, The expected number of pairs of connected nodes: Pair-connected reliability, Reliability optimization of distributed computing systems subject to capacity constraints, Reliability and cost optimization in distributed computing systems., Sixty years of network reliability, A new simulation method based on the RVR principle for the rare event network reliability problem, Optimal task allocation and hardware redundancy policies in distributed computing systems
