Algorithms for K-terminal reliability problems with node failures

DOI10.1002/net.3230220405zbMath0764.90034MaRDI 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 network; circle graph; unreliable nodes; distributed processing system

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90B18: Communication networks in operations research

90B25: Reliability, availability, maintenance, inspection in operations research

Related Items

Computing optimal assignments for residual network reliability