Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Efficiently Computing k-Edge Connected Components via Graph Decomposition

Date

Authors

Chang, Lijun

Yu, Jeffrey

Qin, Lu

Lin, Xuemin

liu, Chengfei

Liang, Weifa

Publisher

Conference Organising Committee

Abstract

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

Keywords

Keywords: 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 cut

URI

http://hdl.handle.net/1885/25673

Collections

ANU Research Publications

Type

Conference paper

DOI

10.1145/2463676.2465323

Restricted until

2037-12-31

Downloads

File

Description

01_Chang_Efficiently_Computing_k-Edge_2013.pdf (547.94 KB)