Rui Zhou 0001, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang, Baichen Chen, Jianxin Li. Finding maximal k-edge-connected subgraphs from a large graph. In Elke A. Rundensteiner, Volker Markl, Ioana Manolescu, Sihem Amer-Yahia, Felix Naumann, Ismail Ari, editors, 15th International Conference on Extending Database Technology, EDBT '12, Berlin, Germany, March 27-30, 2012, Proceedings. pages 480-491, ACM, 2012. [doi]
@inproceedings{ZhouLYLCL12,
title = {Finding maximal k-edge-connected subgraphs from a large graph},
author = {Rui Zhou 0001 and Chengfei Liu and Jeffrey Xu Yu and Weifa Liang and Baichen Chen and Jianxin Li},
year = {2012},
doi = {10.1145/2247596.2247652},
url = {http://doi.acm.org/10.1145/2247596.2247652},
researchr = {https://researchr.org/publication/ZhouLYLCL12},
cites = {0},
citedby = {0},
pages = {480-491},
booktitle = {15th International Conference on Extending Database Technology, EDBT '12, Berlin, Germany, March 27-30, 2012, Proceedings},
editor = {Elke A. Rundensteiner and Volker Markl and Ioana Manolescu and Sihem Amer-Yahia and Felix Naumann and Ismail Ari},
publisher = {ACM},
isbn = {978-1-4503-0790-1},
}