Reliability of directed networks using the factoring theorem

DOI10.1109/24.46479zbMath0691.90031OpenAlexW2159461715WikidataQ56966568 ScholiaQ56966568MaRDI QIDQ3033540

Jo Ellen Perry, Lavon Page

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

network reliability2- terminal reliabilityfactoring theoremsource-to-sink communication

Mathematics Subject Classification ID

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

Related Items (6)

Fast computation of bounds for two-terminal network reliability ⋮ Information security: Designing a stochastic-network for throughput and reliability ⋮ A factoring approach for the stochastic shortest path problem ⋮ Fault-tree modelling of computer system security ⋮ A network reduction axiom for efficient computation of terminal-pair reliability ⋮ Terminal-pair reliability in ATM virtual path networks

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