A fast approximate method for-edge connected component detection in graphs with high accuracy

Ting Yu, Mengchi Liu, Zujie Ren, Ji Zhang

Abstract: Highlights•An efficient local edge connectivity check based decomposition framework to detect k-ECCs with high accuracy of results.•A k-core based maximal merging and a pruning strategy for optimizing the algorithm processing time and the height of decomposition tree.•An improved augmenting path flow method to directly calculate the minimum cut of two vertices in the check procedure.•Experimental results show that the algorithm can detect k-ECCs with outstanding speed while producing high-quality results (96% accuracy).