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, 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 Document type: Conference Paper Collections: Faculty of Science, Engineering and Built Environment School of Information Technology Related Links Link Description Connect to published version Go to link with your DU access privileges     Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved. Versions Version Filter Type Thu, 20 Dec 2018, 18:21:39 EST Thu, 20 Dec 2018, 18:23:12 EST Fri, 21 Dec 2018, 04:02:45 EST Wed, 18 Nov 2020, 14:37:20 EST Wed, 18 Nov 2020, 14:38:57 EST Wed, 18 Nov 2020, 14:58:23 EST Filtered Full Citation counts:   Cited 0 times in TR Web of Science Cited 30 times in Scopus Search Google Scholar Access Statistics: 45 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.