Linear time algorithms for finding a sparse k-connected spanning subgraph of a k-connected graph”, Algorithmica 7 (1992)

by H Nagamochi, T Ibaraki