Skip navigation
Skip navigation

Efficiently Computing k-Edge Connected Components via Graph Decomposition

Chang, Lijun; Yu, Jeffrey; Qin, Lu; Lin, Xuemin; liu, Chengfei; Liang, Weifa


Efficiently 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 optimizatio

CollectionsANU Research Publications
Date published: 2013
Type: Conference paper
DOI: 10.1145/2463676.2465323


File Description SizeFormat Image
01_Chang_Efficiently_Computing_k-Edge_2013.pdf547.94 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator