Partial factoring: an efficient algorithm for approximating two-terminal reliability on complete graphs

DOI10.1109/24.103005zbMATH Open0723.90030OpenAlexW2123627392MaRDI QIDQ5202014FDOQ5202014

Thomas A. Feo, Rubin Johnson

Publication date: 1990

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

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

zbMATH Keywords

efficient network reliability approximation algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Stochastic network models in operations research (90B15)

Cited In (2)

• Fast computation of bounds for two-terminal network reliability
• A novel algorithm on network reliability estimation

   Recommendations

• Factoring Algorithms for Computing K-Terminal Network Reliability 👍 👎
• A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability 👍 👎
• A decomposition algorithm for network reliability evaluation 👍 👎
• Algebraic Methods Applied to Network Reliability Problems 👍 👎
• Practical sequential bounds for approximating two-terminal reliability 👍 👎

This page was built for publication: Partial factoring: an efficient algorithm for approximating two-terminal reliability on complete graphs

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