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

Harold N. Gabow. Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph. In SODA. pages 460-469, 2003. [doi]

Abstract

Abstract is missing.