Luis Pedro Montejano, Ignasi Sau. On the complexity of computing the k-restricted edge-connectivity of a graph. Theoretical Computer Science, 662:31-39, 2017. [doi]
@article{MontejanoS17,
title = {On the complexity of computing the k-restricted edge-connectivity of a graph},
author = {Luis Pedro Montejano and Ignasi Sau},
year = {2017},
doi = {10.1016/j.tcs.2016.12.006},
url = {http://dx.doi.org/10.1016/j.tcs.2016.12.006},
researchr = {https://researchr.org/publication/MontejanoS17},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {662},
pages = {31-39},
}