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 references recorded for this publication.
No citations of this publication recorded.