On the Complexity of Computing the k-restricted Edge-connectivity of a Graph.

Luis Pedro Montejano, Ignasi Sau

Browse the full WG paper archive.