Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia. Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem. Discrete Applied Mathematics, 253:103-121, 2019. [doi]
@article{AringhieriGHS19,
title = {Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem},
author = {Roberto Aringhieri and Andrea Grosso and Pierre Hosteins and Rosario Scatamacchia},
year = {2019},
doi = {10.1016/j.dam.2017.12.035},
url = {https://doi.org/10.1016/j.dam.2017.12.035},
researchr = {https://researchr.org/publication/AringhieriGHS19},
cites = {0},
citedby = {0},
journal = {Discrete Applied Mathematics},
volume = {253},
pages = {103-121},
}