Finding maximal k-edge-connected subgraphs from a large graph

Zhou, Rui, Liu, Chengfei, Yu, Jeffrey Xu, Liang, Weifa, Chen, Baichen and Li, Jianxin 2012, Finding maximal k-edge-connected subgraphs from a large graph, in EDBT '12: Proceedings of the 15th International Conference on Extending Database Technology, ACM Press,, pp. 480-491, doi: 10.1145/2247596.2247652.

Attached Files
Name Description MIMEType Size Downloads

Title Finding maximal k-edge-connected subgraphs from a large graph
Author(s) Zhou, Rui
Liu, Chengfei
Yu, Jeffrey Xu
Liang, Weifa
Chen, Baichen
Li, JianxinORCID iD for Li, Jianxin orcid.org/0000-0002-9059-330X
Conference name Association for Computing Machinery. Conference (15th : 2012 : Berlin, Germany)
Conference location Berlin, Germany
Conference dates 2012/03/27 - 2012/03/30
Title of proceedings EDBT '12: Proceedings of the 15th International Conference on Extending Database Technology
Publication date 2012
Start page 480
End page 491
Total pages 12
Publisher ACM Press
ISBN 9781450307901
Language eng
DOI 10.1145/2247596.2247652
Indigenous content off
HERDC Research category E1.1 Full written paper - refereed
Persistent URL http://hdl.handle.net/10536/DRO/DU:30116218

Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 27 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 15 Abstract Views, 2 File Downloads  -  Detailed Statistics
Created: Thu, 20 Dec 2018, 18:23:11 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.