Using the Decomposition Tree for Directed-Network Reliability Computation

DOI10.1109/TR.1984.5221876MaRDI QIDQ3730315zbMATH OpenFDO

Authors Jane N. Hagstrom

Publication date 1984

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

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

zbMATH Keywords

2-terminal communicationdecomposition treedirect networkspath-length feasibilityreliability of an undirected networktransportation flow feasibility

Mathematics Subject Classification ID

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

Recommendations

• A decomposition algorithm for network reliability evaluation
• An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed Networks
• Algebraic Methods Applied to Network Reliability Problems
• Computing rooted communication reliability in an almost acyclic digraph
• Reliability Computations for Planar Networks

Cited in

(4)

• An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed Networks
• On Reliability Evaluation by Network Decomposition
• Computing rooted communication reliability in an almost acyclic digraph
• Linking-Centers and Reliable-Trees of a Network

This page was built for publication: Using the Decomposition Tree for Directed-Network Reliability Computation

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