The complexity of computing the 2-K-reliability in networks
DOI10.1016/J.IPL.2014.03.010zbMATH Open1296.68064OpenAlexW2070456106MaRDI QIDQ2448852FDOQ2448852
Authors: Eduardo A. Canale, Héctor Cancela, Pablo Sartor, Franco Robledo 
Publication date: 5 May 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2014.03.010
Recommendations
- On computing the 2-diameter-constrained \(K\)-reliability of networks
- Full complexity analysis of the diameter-constrained reliability
- Diameter constrained reliability: complexity, distinguished topologies and asymptotic behavior
- Reliability of communication networks with delay constraints: computational complexity and complete topologies
- Diameter constrained reliability of ladders and Spanish fans
computational complexityfault tolerancecombinatorial problemssurvivabilitynetwork reliabilitydiameter constraints
Reliability, availability, maintenance, inspection in operations research (90B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Reliability, testing and fault tolerance of networks and computer systems (68M15) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Cites Work
Cited In (5)
- On computing the 2-diameter-constrained \(K\)-reliability of networks
- Diameter constrained reliability: complexity, distinguished topologies and asymptotic behavior
- Linear-time algorithms for computing the reliability of bipartite and (\(\# \leqslant 2\)) star distributed computing systems.
- An O(n*log(n)) algorithm to compute the all-terminal reliability of (K/sub 5/, K/sub 2.2.2/) free networks
- Full complexity analysis of the diameter-constrained reliability
This page was built for publication: The complexity of computing the 2-K-reliability in networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448852)
