Efficiently Computing k-Edge Connected Components via Graph Decomposition
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
|Collections||ANU Research Publications|
|01_Chang_Efficiently_Computing_k-Edge_2013.pdf||547.94 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.