Chang, LijunYu, JeffreyQin, LuLin, Xueminliu, ChengfeiLiang, Weifa2015-12-07June 22-279781450320375http://hdl.handle.net/1885/25673Efficiently computing k-edge connected components in a large graph, G = (V, E), where V is the vertex set and E is the edge set, is a long standing research problem. It is not only fundamental in graph analysis but also crucial in graph search optimizatioKeywords: Connected component; Graph decompositions; Minimum cut; Orders of magnitude; Performance study; Research problems; State-of-the-art techniques; Synthetic graphs; Algorithms; Iterative methods; Graph theory Graph decomposition; K-edge connected components; Minimum cut201310.1145/2463676.24653232016-02-24