On the complexity of computing the k-restricted edge-connectivity of a graph

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]

No reviews for this publication, yet.