{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T12:41:34Z","timestamp":1782304894498,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,3,27]],"date-time":"2012-03-27T00:00:00Z","timestamp":1332806400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP120102627"],"award-info":[{"award-number":["DP120102627"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee, Hong Kong","doi-asserted-by":"publisher","award":["419109"],"award-info":[{"award-number":["419109"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,3,27]]},"DOI":"10.1145\/2247596.2247652","type":"proceedings-article","created":{"date-parts":[[2012,6,11]],"date-time":"2012-06-11T13:03:31Z","timestamp":1339419811000},"page":"480-491","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":84,"title":["Finding maximal k-edge-connected subgraphs from a large graph"],"prefix":"10.1145","author":[{"given":"Rui","family":"Zhou","sequence":"first","affiliation":[{"name":"Swinburne University of Technology, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chengfei","family":"Liu","sequence":"additional","affiliation":[{"name":"Swinburne University of Technology, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weifa","family":"Liang","sequence":"additional","affiliation":[{"name":"Australian National University, Canberra, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Baichen","family":"Chen","sequence":"additional","affiliation":[{"name":"Australian National University, Canberra, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianxin","family":"Li","sequence":"additional","affiliation":[{"name":"Swinburne University of Technology, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,3,27]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"598","volume-title":"LATIN","author":"Abello J.","year":"2002","unstructured":"J. Abello , M. G. C. Resende , and S. Sudarsky . Massive quasi-clique detection . In LATIN , pages 598 -- 612 , 2002 . J. Abello, M. G. C. Resende, and S. Sudarsky. Massive quasi-clique detection. In LATIN, pages 598--612, 2002."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775227"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","DOI":"10.1002\/9781118903032","volume-title":"Transportation Network Analysis","author":"Bell M.","year":"1997","unstructured":"M. Bell and Y. Iida . Transportation Network Analysis . John Wiley & amp; Sons, Inc., USA, 1997 . M. Bell and Y. Iida. Transportation Network Analysis. John Wiley & Sons, Inc., USA, 1997."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1086\/209118"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/0114065"},{"key":"e_1_3_2_1_6_1","first-page":"324","volume-title":"SODA","author":"Chekuri C.","year":"1997","unstructured":"C. Chekuri , A. V. Goldberg , D. R. Karger , M. S. Levine , and C. Stein . Experimental study of minimum cut algorithms . In SODA , pages 324 -- 333 , 1997 . C. Chekuri, A. V. Goldberg, D. R. Karger, M. S. Levine, and C. Stein. Experimental study of minimum cut algorithms. In SODA, pages 324--333, 1997."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807217"},{"key":"e_1_3_2_1_8_1","volume-title":"The Combinatorics of Network Reliability","author":"Colbourn C. J.","year":"1987","unstructured":"C. J. Colbourn . The Combinatorics of Network Reliability . Oxford University Press, Inc. , New York, NY, USA , 1987 . C. J. Colbourn. The Combinatorics of Network Reliability. Oxford University Press, Inc., New York, NY, USA, 1987."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0109047"},{"key":"e_1_3_2_1_10_1","first-page":"165","volume-title":"SODA","author":"Hao J.","year":"1992","unstructured":"J. Hao and J. B. Orlin . A faster algorithm for finding the minimum cut in a graph . In SODA , pages 165 -- 174 , 1992 . J. Hao and J. B. Orlin. A faster algorithm for finding the minimum cut in a graph. In SODA, pages 165--174, 1992."},{"key":"e_1_3_2_1_11_1","first-page":"127","volume-title":"SODA","author":"Hariharan R.","year":"2007","unstructured":"R. Hariharan , T. Kavitha , and D. Panigrahi . Efficient algorithms for computing all low s-t edge connectivities and related problems . In SODA , pages 127 -- 136 , 2007 . R. Hariharan, T. Kavitha, and D. Panigrahi. Efficient algorithms for computing all low s-t edge connectivities and related problems. In SODA, pages 127--136, 2007."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(89)90022-1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405004"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758778"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-008-0109-y"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00124"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39718-2_23"},{"key":"e_1_3_2_1_21_1","volume-title":"Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. CoRR, cs.DC\/0209028","author":"Ripeanu M.","year":"2002","unstructured":"M. Ripeanu , I. T. Foster , and A. Iamnitchi . Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. CoRR, cs.DC\/0209028 , 2002 . M. Ripeanu, I. T. Foster, and A. Iamnitchi. Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. CoRR, cs.DC\/0209028, 2002."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557101"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1978.9989883"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2032324100"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263872"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281280"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081908"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242524.1242530"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557127"}],"event":{"name":"EDBT '12: 15th International Conference on Extending Database Technology","location":"Berlin Germany","acronym":"EDBT '12"},"container-title":["Proceedings of the 15th International Conference on Extending Database Technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2247596.2247652","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2247596.2247652","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:49:04Z","timestamp":1750236544000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2247596.2247652"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,27]]},"references-count":31,"alternative-id":["10.1145\/2247596.2247652","10.1145\/2247596"],"URL":"https:\/\/doi.org\/10.1145\/2247596.2247652","relation":{},"subject":[],"published":{"date-parts":[[2012,3,27]]},"assertion":[{"value":"2012-03-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}