Triconnected decomposition for computingK-terminal network reliability

DOI10.1002/NET.3230190203MaRDI QIDQ3827780zbMATH OpenOpenAlexFDO

Authors R. Kevin Wood

Publication date 1989

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230190203

zbMATH Keywords

failure probabilities of the edgesK-terminal reliabilityrecursive factoring algorithmreliabilitytriconnected decompositionundirected graph

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• A decomposition algorithm for network reliability evaluation
• Factoring Algorithms for Computing K-Terminal Network Reliability
• 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
• scientific article; zbMATH DE number 21369

Cites work

• Network reliability and acyclic orientations

Cited in

(15)

• A note on bounding \(k\)-terminal reliability
• Evaluating network reliability and 2-edge-connected reliability in linear time for bounded pathwidth graphs
• A network reduction axiom for efficient computation of terminal-pair reliability
• A decomposition algorithm for network reliability evaluation
• A combined decomposition-reduction approach to the K-terminal reliability of. stochastic networks
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• Network reliability analysis using 2-connected digraph reductions
• A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability
• Factoring Algorithms for Computing K-Terminal Network Reliability
• scientific article; zbMATH DE number 21369 (Why is no real title available?)
• IEEE Trans. Reliab.,
• VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY
• Maintaining triconnected components under node expansion
• Network reliability: Heading out on the highway
• Parallel computing the diameter constrained reliability of networks using supercomputers with distributed memory

This page was built for publication: Triconnected decomposition for computingK-terminal network reliability

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