The complexity of computing the 2-K-reliability in networks

Eduardo A. Canale, Héctor Cancela, Franco Robledo, Pablo Sartor. The complexity of computing the 2-K-reliability in networks. Inf. Process. Lett., 114(9):457-461, 2014. [doi]

@article{CanaleCRS14,
  title = {The complexity of computing the 2-K-reliability in networks},
  author = {Eduardo A. Canale and Héctor Cancela and Franco Robledo and Pablo Sartor},
  year = {2014},
  doi = {10.1016/j.ipl.2014.03.010},
  url = {http://dx.doi.org/10.1016/j.ipl.2014.03.010},
  researchr = {https://researchr.org/publication/CanaleCRS14},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {114},
  number = {9},
  pages = {457-461},
}