Reliability of communication networks with delay constraints: computational complexity and complete topologies

DOI10.1155/S016117120430623XzbMath1061.05091MaRDI QIDQ1774774

Louis Petingi, Héctor Cancela

Publication date: 18 May 2005

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/51252

zbMATH Keywords

distance

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Graph theory (05C99)

Related Items (5)

Computing diameter constrained reliability of a network with junction points ⋮ The complexity of computing the 2-K-reliability in networks ⋮ On computing the 2‐diameter ‐constrained K ‐reliability of networks ⋮ Factorization and exact evaluation of the source-terminal diameter-constrained reliability ⋮ Full complexity analysis of the diameter-constrained reliability

This page was built for publication: Reliability of communication networks with delay constraints: computational complexity and complete topologies