Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph.

Harold N. Gabow

Browse the full SODA paper archive.