{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:30:15Z","timestamp":1765499415177,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61902004, 72201275, 6197700"],"award-info":[{"award-number":["61902004, 72201275, 6197700"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,10]]},"DOI":"10.1145\/3746252.3761042","type":"proceedings-article","created":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T23:59:18Z","timestamp":1762559958000},"page":"898-907","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Computation of\n                    <i>k<\/i>\n                    -Vertex Connected Components in Large Scale Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-7654-1756","authenticated-orcid":false,"given":"Xinchao","family":"Hu","sequence":"first","affiliation":[{"name":"North China University of Technology, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3567-2101","authenticated-orcid":false,"given":"Yuan","family":"Li","sequence":"additional","affiliation":[{"name":"North China University of Technology, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7082-4867","authenticated-orcid":false,"given":"Feng","family":"Guo","sequence":"additional","affiliation":[{"name":"North China University of Technology, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1758-755X","authenticated-orcid":false,"given":"Shan","family":"Huang","sequence":"additional","affiliation":[{"name":"Dalian Minzu University, Dalian, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1076-2119","authenticated-orcid":false,"given":"Guoli","family":"Yang","sequence":"additional","affiliation":[{"name":"Advanced Institute of Big Data, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1080-0859","authenticated-orcid":false,"given":"Yuhai","family":"Zhao","sequence":"additional","affiliation":[{"name":"Northeastern University, Shenyang, China"}]}],"member":"320","published-online":{"date-parts":[[2025,11,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00142"},{"key":"e_1_3_2_1_2_1","first-page":"909","article-title":"Linear-time enumeration of maximal k-edge-connected subgraphs in large networks by random contraction","author":"Akiba Takuya","year":"2013","unstructured":"Takuya Akiba, Yoichi Iwata, and Yuichi Yoshida. 2013. Linear-time enumeration of maximal k-edge-connected subgraphs in large networks by random contraction. In CIKM. 909-918.","journal-title":"CIKM."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-021-00948-4"},{"key":"e_1_3_2_1_4_1","volume-title":"An o (m) algorithm for cores decomposition of networks. CoRR","author":"Batagelj Vladimir","year":"2003","unstructured":"Vladimir Batagelj and Matjaz Zaversnik. 2003. An o (m) algorithm for cores decomposition of networks. CoRR, Vol. cs.DS\/0310049 (2003)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2020.08.010"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9632-8"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3389989"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502550"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140211"},{"key":"e_1_3_2_1_10_1","series-title":"SIAM journal on computing","volume-title":"Network flow and testing graph connectivity","author":"Even Shimon","year":"1975","unstructured":"Shimon Even and R Endre Tarjan. 1975. Network flow and testing graph connectivity. SIAM journal on computing, Vol. 4, 4 (1975), 507-518."},{"key":"e_1_3_2_1_11_1","first-page":"85","article-title":"Computing connected components with linear communication cost in pregel-like systems","author":"Feng Xing","year":"2016","unstructured":"Xing Feng, Lijun Chang, Xuemin Lin, Lu Qin, and Wenjie Zhang. 2016. Computing connected components with linear communication cost in pregel-like systems. In ICDE. 85-96.","journal-title":"ICDE."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477314.3507064"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3436905.3436916"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250879"},{"key":"e_1_3_2_1_15_1","volume-title":"Towards k-vertex connected component discovery from large networks. World Wide Web (Mar","author":"Li Yuan","year":"2020","unstructured":"Yuan Li, Guoren Wang, Yuhai Zhao, Feida Zhu, and Yubao Wu. 2020. Towards k-vertex connected component discovery from large networks. World Wide Web (Mar 2020), 799-830."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Yuan Li Yuhai Zhao Guoren Wang Feida Zhu Yubao Wu and Shengle Shi. 2017. Effective k-vertex connected component detection in large-scale networks. In DASFAA (2). 404-421.","DOI":"10.1007\/978-3-319-55699-4_25"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00233"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(78)90071-0"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.4064\/fm-10-1-96-115"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"James Moody and Douglas R White. 2003. Structural cohesion and embeddedness: A hierarchical concept of social groups. Am. Soc. Rev. (2003) 103-127.","DOI":"10.1177\/000312240306800105"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Sriram Pemmaraju Steven Skiena et al. 2003. Computational discrete mathematics: Combinatorics and graph theory with mathematica\u00ae . Cambridge university press.","DOI":"10.1017\/CBO9781139164849"},{"key":"e_1_3_2_1_22_1","first-page":"50","article-title":"Finding connected components in map-reduce in logarithmic rounds","author":"Rastogi Vibhor","year":"2013","unstructured":"Vibhor Rastogi, Ashwin Machanavajjhala, Laukik Chitnis, and Anish Das Sarma. 2013. Finding connected components in map-reduce in logarithmic rounds. In ICDE. 50-61.","journal-title":"ICDE."},{"key":"e_1_3_2_1_23_1","volume-title":"Mass spectrometry-based protein-protein interaction networks for the study of human diseases. Molecular systems biology","author":"Richards Alicia L","year":"2021","unstructured":"Alicia L Richards, Manon Eckhardt, and Nevan J Krogan. 2021. Mass spectrometry-based protein-protein interaction networks for the study of human diseases. Molecular systems biology, Vol. 17 (2021), e8792."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1978.9989883"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593665"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2016.10.005"},{"volume-title":"The algorithm design manual","author":"Skiena Steven S","key":"e_1_3_2_1_27_1","unstructured":"Steven S Skiena. 1998. The algorithm design manual. Vol. 2. Springer."},{"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","volume-title":"Adaptive Truss Maximization on Large Graphs: A Minimum Cut Approach. In 2024 IEEE 40th International Conference on Data Engineering (ICDE). IEEE, 3270-3282","author":"Sun Zitan","year":"2024","unstructured":"Zitan Sun, Xin Huang, Chengzhi Piao, Cheng Long, and Jianliang Xu. 2024. Adaptive Truss Maximization on Large Graphs: A Minimum Cut Approach. In 2024 IEEE 40th International Conference on Data Engineering (ICDE). IEEE, 3270-3282."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.21307\/joss-2019-018"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1002\/dac.3953"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055540.3055543"},{"key":"e_1_3_2_1_33_1","first-page":"52","article-title":"Enumerating k-vertex connected components in large graphs","author":"Wen Dong","year":"2019","unstructured":"Dong Wen, Lu Qin, Ying Zhang, Lijun Chang, and Ling Chen. 2019. Enumerating k-vertex connected components in large graphs. In ICDE. 52-63.","journal-title":"ICDE."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1111\/0081-1750.00098"},{"key":"e_1_3_2_1_35_1","volume-title":"Congruent graphs and the connectivity of graphs. HWCP","author":"Whitney Hassler","year":"1992","unstructured":"Hassler Whitney. 1992. Congruent graphs and the connectivity of graphs. HWCP (1992), 61-79."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589315"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00688-z"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150506"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247652"}],"event":{"name":"CIKM '25: The 34th ACM International Conference on Information and Knowledge Management","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Seoul Republic of Korea","acronym":"CIKM '25"},"container-title":["Proceedings of the 34th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3746252.3761042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:25:55Z","timestamp":1765499155000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3746252.3761042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,10]]},"references-count":39,"alternative-id":["10.1145\/3746252.3761042","10.1145\/3746252"],"URL":"https:\/\/doi.org\/10.1145\/3746252.3761042","relation":{},"subject":[],"published":{"date-parts":[[2025,11,10]]},"assertion":[{"value":"2025-11-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}