A New Algorithm for the Reliability Analysis of Multi-Terminal Networks

DOI10.1109/TR.1981.5221103MaRDI QIDQ3944324zbMATH OpenFDO

Authors

Publication date 1981

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

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

zbMATH Keywords

acyclic subgraphalgorithmcyclic subgraphexact reliabilityprobabilistic networksreliability algorithmsource-to-multiple-terminal reliabilityspanning rooted treetopological formula

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25)

Cited in

(4)

• A new heuristic approach for reliability optimization of distributed computing systems subject to capacity constraints
• Domination of cyclic monotone \((s,t)\)-graphs
• The computational complexity of the reliability problem on distributed systems
• A genetic algorithm for reliability-oriented task assignment in a distributed system

This page was built for publication: A New Algorithm for the Reliability Analysis of Multi-Terminal Networks

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