Factoring Algorithms for Computing K-Terminal Network Reliability

DOI10.1109/TR.1986.4335431MaRDI QIDQ3738893zbMATH OpenFDO

Authors R. Kevin Wood

Publication date 1986

Published in IEEE Transactions on Reliability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TR.1986.4335431

zbMATH Keywords

edge failurefactoring algorithmK-terminal reliabilitynetwork reliabilitypivotal decompositionreliability-preserving reductions

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• Triconnected decomposition for computingK-terminal network reliability
• A decomposition algorithm for network reliability evaluation
• Partial factoring: an efficient algorithm for approximating two-terminal reliability on complete graphs

Cited in

(25)

• 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.
• A network reduction axiom for efficient computation of terminal-pair reliability
• Sixty years of network reliability
• A new simulation method based on the RVR principle for the rare event network reliability problem
• New expressions for the extended -Y reductions
• Optimal task allocation and hardware redundancy policies in distributed computing systems
• The computational complexity of the reliability problem on distributed systems
• Reliability of directed networks using the factoring theorem
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability
• Some Lattice-Theoretic Tools for Network Reliability Analysis
• Implementation of a factoring algorithm for reliability evaluation of undirected networks
• Triconnected decomposition for computingK-terminal network reliability
• K-terminal reliability of hierarchical networks
• scientific article; zbMATH DE number 1218894 (Why is no real title available?)
• scientific article; zbMATH DE number 1304835 (Why is no real title available?)
• Tele-network design based on queue competition algorithm
• Accurate and interval estimates of the probability of network service availability for communication networks
• Partial factoring: an efficient algorithm for approximating two-terminal reliability on complete graphs
• The distributed program reliability analysis on ring-type topologies
• Reliable assignments of processors to tasks and factoring on matroids
• An optimization-based Monte Carlo method for estimating the two-terminal survival signature of networks with two component classes

This page was built for publication: Factoring Algorithms for Computing K-Terminal Network Reliability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3738893)