A Near-optimal Algorithm for Edge Connectivity-based Hierarchical Graph Decomposition

Lijun Chang

Driven by many applications in graph analytics, the problem of computing $k$-edge connected components ($k$-ECCs) of a graph $G$ for a user-given $k$ has been extensively studied r…