Parallel algorithms for terminal-pair reliability

DOI10.1109/24.257782MaRDI QIDQ4018969zbMATH OpenOpenAlexFDO

Authors Narsingh Deo, Muralidhar Medidi

Publication date 16 January 1993

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

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

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Reliability, testing and fault tolerance of networks and computer systems (68M15) Reliability, availability, maintenance, inspection in operations research (90B25) Programming involving graphs or networks (90C35)

Cited in

(3)

• A network reduction axiom for efficient computation of terminal-pair reliability
• Terminal-pair reliability in ATM virtual path networks
• Parallel computing the diameter constrained reliability of networks using supercomputers with distributed memory

This page was built for publication: Parallel algorithms for terminal-pair reliability

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