A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability
From MaRDI portal
Publication:3716781
DOI10.1002/net.3230150204zbMath0588.90030OpenAlexW2017419657MaRDI QIDQ3716781
Publication date: 1985
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230150204
Analysis of algorithms and problem complexity (68Q25) Reliability, availability, maintenance, inspection in operations research (90B25) Probabilistic methods, stochastic differential equations (65C99)
Related Items (7)
Fast computation of bounds for two-terminal network reliability ⋮ Algebraic Methods Applied to Network Reliability Problems ⋮ Network reliability: Heading out on the highway ⋮ Factorization of network reliability with perfect nodes. I: Introduction and statements ⋮ VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY ⋮ Reliable assignments of processors to tasks and factoring on matroids ⋮ A new simulation method based on the RVR principle for the rare event network reliability problem
This page was built for publication: A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability
