Algorithms for K-terminal reliability problems with node failures

DOI10.1002/NET.3230220405MaRDI QIDQ4018995zbMATH OpenOpenAlexFDO

Authors Ehab S. Elmallah

Publication date 16 January 1993

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230220405

zbMATH Keywords

circle graphcommunication networkdistributed processing systemunreliable nodes

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A polynomial-time algorithm for computing \(K\)-terminal residual reliability of \(d\)-trapezoid graphs
• Computing \(K\)-terminal reliability of \(d\)-trapezoid graphs
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• Computing the \(K\)-terminal reliability of directed path graphs
• A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability

Cited in

(8)

• Computing optimal assignments for residual network reliability
• Computing the \(K\)-terminal reliability of directed path graphs
• Computing \(K\)-terminal reliability of \(d\)-trapezoid graphs
• scientific article; zbMATH DE number 1161336 (Why is no real title available?)
• scientific article; zbMATH DE number 1472180 (Why is no real title available?)
• A polynomial-time algorithm for computing \(K\)-terminal residual reliability of \(d\)-trapezoid graphs
• Note on: “A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Network”
• Network reliability: Heading out on the highway

This page was built for publication: Algorithms for K-terminal reliability problems with node failures

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