Algorithms for K-terminal reliability problems with node failures

DOI10.1002/net.3230220405zbMath0764.90034OpenAlexW2170275891MaRDI QIDQ4018995

Ehab S. El-Mallah

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

communication networkcircle graphunreliable nodesdistributed processing system

Mathematics Subject Classification ID

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

Related Items (3)

Computing optimal assignments for residual network reliability ⋮ Network reliability: Heading out on the highway ⋮ A polynomial-time algorithm for computing \(K\)-terminal residual reliability of \(d\)-trapezoid graphs

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