This thesis concentrates on algorithms for finding all the maximal k-edge-connected components in a given graph G = (V, E) where V and E represent the set of vertices and the set of edges, respectively, which are further ...