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
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.