{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T02:11:25Z","timestamp":1784167885856,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,5,27]],"date-time":"2015-05-27T00:00:00Z","timestamp":1432684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ARC","award":["DP150102728"],"award-info":[{"award-number":["DP150102728"]}]},{"name":"ARC","award":["DP140103578"],"award-info":[{"award-number":["DP140103578"]}]},{"name":"ARC","award":["DE150100563"],"award-info":[{"award-number":["DE150100563"]}]},{"name":"ARC","award":["DP120104168"],"award-info":[{"award-number":["DP120104168"]}]},{"name":"ARC","award":["DE140100999"],"award-info":[{"award-number":["DE140100999"]}]},{"name":"ARC","award":["DE120102144"],"award-info":[{"award-number":["DE120102144"]}]},{"name":"RGC","award":["418512"],"award-info":[{"award-number":["418512"]}]},{"name":"RGC","award":["14209314"],"award-info":[{"award-number":["14209314"]}]},{"name":"NSFC","award":["61232006"],"award-info":[{"award-number":["61232006"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,5,27]]},"DOI":"10.1145\/2723372.2746486","type":"proceedings-article","created":{"date-parts":[[2015,6,2]],"date-time":"2015-06-02T05:35:02Z","timestamp":1433223302000},"page":"459-474","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":56,"title":["Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity"],"prefix":"10.1145","author":[{"given":"Lijun","family":"Chang","sequence":"first","affiliation":[{"name":"University of New South Wales, Sydney, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[{"name":"University of Technology, Sydney, Sydney, 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":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,5,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687725"},{"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":"publisher","DOI":"10.1145\/800125.804056"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505751"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/646388.690192"},{"key":"e_1_3_2_1_6_1","volume-title":"Fast maximal cliques enumeration in sparse graphs. Algorithmica, 66(1)","author":"Chang L.","year":"2013","unstructured":"L. Chang , J. X. Yu , and L. Qin . Fast maximal cliques enumeration in sparse graphs. Algorithmica, 66(1) , 2013 . L. Chang, J. X. Yu, and L. Qin. Fast maximal cliques enumeration in sparse graphs. Algorithmica, 66(1), 2013."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465323"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807217"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"e_1_3_2_1_11_1","first-page":"72","article-title":"Finding local community structure in networks","author":"Clauset A.","year":"2005","unstructured":"A. Clauset . Finding local community structure in networks . Phys. Rev. E , 72 , 2005 . A. Clauset. Finding local community structure in networks. Phys. Rev. E, 72, 2005.","journal-title":"Phys. Rev. E"},{"key":"e_1_3_2_1_12_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. Stein , R. L. Rivest , and C. E. Leiserson . Introduction to Algorithms . McGraw-Hill Higher Education , 2001 . T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson. Introduction to Algorithms. McGraw-Hill Higher Education, 2001."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463722"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612179"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/1-4020-8141-3_17"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1947725.1947768"},{"key":"e_1_3_2_1_17_1","volume-title":"Algorithmic Graph Theory","author":"Gibbons A.","year":"1985","unstructured":"A. Gibbons . Algorithmic Graph Theory . Cambridge University Press , 1985 . A. Gibbons. Algorithmic Graph Theory. Cambridge University Press, 1985."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0109047"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00142-3"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_3_2_1_21_1","volume-title":"Proc. of SODA'13","author":"Kelner J. A.","year":"2013","unstructured":"J. A. Kelner , Y. T. Lee , L. Orecchia , and A. Sidford . An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations . In Proc. of SODA'13 , 2013 . J. A. Kelner, Y. T. Lee, L. Orecchia, and A. Sidford. An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations. In Proc. of SODA'13, 2013."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557074"},{"key":"e_1_3_2_1_23_1","volume-title":"A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica, 7(5&6)","author":"Nagamochi H.","year":"1992","unstructured":"H. Nagamochi and T. Ibaraki . A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica, 7(5&6) , 1992 . H. Nagamochi and T. Ibaraki. A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica, 7(5&6), 1992."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488705"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-008-0109-y"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.36"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263872"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/1921071.1921073"},{"key":"e_1_3_2_1_30_1","first-page":"31","article-title":"The cohesiveness of blocks in social networks: Node connectivity and conditional density","author":"White D. R.","year":"2001","unstructured":"D. R. White and F. Harary . The cohesiveness of blocks in social networks: Node connectivity and conditional density . Sociological Methodology , 31 , 2001 . D. R. White and F. Harary. The cohesiveness of blocks in social networks: Node connectivity and conditional density. Sociological Methodology, 31, 2001.","journal-title":"Sociological Methodology"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081908"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242524.1242530"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.35"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247652"}],"event":{"name":"SIGMOD\/PODS'15: International Conference on Management of Data","location":"Melbourne Victoria Australia","acronym":"SIGMOD\/PODS'15","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2723372.2746486","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2723372.2746486","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:38Z","timestamp":1750227398000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2723372.2746486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,27]]},"references-count":34,"alternative-id":["10.1145\/2723372.2746486","10.1145\/2723372"],"URL":"https:\/\/doi.org\/10.1145\/2723372.2746486","relation":{},"subject":[],"published":{"date-parts":[[2015,5,27]]},"assertion":[{"value":"2015-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}