The complexity of computing the 2-K-reliability in networks
DOI10.1016/j.ipl.2014.03.010zbMath1296.68064OpenAlexW2070456106MaRDI QIDQ2448852
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
computational complexitycombinatorial problemsfault tolerancesurvivabilitynetwork reliabilitydiameter constraints
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) 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)
Related Items (1)
Cites Work
This page was built for publication: The complexity of computing the 2-K-reliability in networks