The problem is to find a minimal k-edge-connected spanning subgraph of a graph G. A connected graph is k-edge-connected if it remains connected whenever fewer than k edges are removed. This repository ...