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

Simple item page
dc.contributor.authorChang, Lijun
dc.contributor.authorYu, Jeffrey
dc.contributor.authorQin, Lu
dc.contributor.authorLin, Xuemin
dc.contributor.authorliu, Chengfei
dc.contributor.authorLiang, Weifa
dc.coverage.spatialNew York Unites States of America
dc.date.accessioned2015-12-07T22:46:11Z
dc.date.createdJune 22-27 2013
dc.date.issued2013
dc.date.updated2016-02-24T12:11:29Z
dc.description.abstractEfficiently 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
dc.identifier.isbn9781450320375
dc.identifier.urihttp://hdl.handle.net/1885/25673
dc.publisherConference Organising Committee
dc.relation.ispartofseriesACM SIGMOD/PODS International Conference on Management of Data 2013
dc.subjectKeywords: 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
dc.titleEfficiently Computing k-Edge Connected Components via Graph Decomposition
dc.typeConference paper
local.bibliographicCitation.lastpage226
local.bibliographicCitation.startpage205
local.contributor.affiliationChang, Lijun, University of New South Wales
local.contributor.affiliationYu, Jeffrey, University of Hong Kong
local.contributor.affiliationQin, Lu, Chinese University of Hong Kong
local.contributor.affiliationLin, Xuemin, University of New South Wales
local.contributor.affiliationliu, Chengfei, Swinburne University of Technology
local.contributor.affiliationLiang, Weifa, College of Engineering and Computer Science, ANU
local.contributor.authoruidLiang, Weifa, u9404892
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.absfor080201 - Analysis of Algorithms and Complexity
local.identifier.absfor080503 - Networking and Communications
local.identifier.absseo890103 - Mobile Data Networks and Services
local.identifier.absseo899899 - Environmentally Sustainable Information and Communication Services not elsewhere classified
local.identifier.ariespublicationu9609633xPUB39
local.identifier.doi10.1145/2463676.2465323
local.identifier.scopusID2-s2.0-84880534983
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
01_Chang_Efficiently_Computing_k-Edge_2013.pdf
Size:
547.94 KB
Format:
Adobe Portable Document Format
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS