Reliability of directed networks using the factoring theorem

DOI10.1109/24.46479MaRDI QIDQ3033540zbMATH OpenOpenAlexWikidataFDO

Authors Lavon Page, Jo Ellen Perry

Publication date 1989

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

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

zbMATH Keywords

2- terminal reliabilityfactoring theoremnetwork reliabilitysource-to-sink communication

Mathematics Subject Classification ID

Graph theory (05C99) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Factoring Algorithms for Computing K-Terminal Network Reliability
• Implementation of a factoring algorithm for reliability evaluation of undirected networks
• Algebraic Methods Applied to Network Reliability Problems
• A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability
• Partial factoring: an efficient algorithm for approximating two-terminal reliability on complete graphs

Cited in

(8)

• A factoring approach for the stochastic shortest path problem
• A network reduction axiom for efficient computation of terminal-pair reliability
• Terminal-pair reliability in ATM virtual path networks
• Fast computation of bounds for two-terminal network reliability
• Node partition formula for directed graph reliability
• Implementation of a factoring algorithm for reliability evaluation of undirected networks
• Information security: Designing a stochastic-network for throughput and reliability
• Fault-tree modelling of computer system security

This page was built for publication: Reliability of directed networks using the factoring theorem

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