{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:05:46Z","timestamp":1750309546301,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T00:00:00Z","timestamp":1745280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,4,22]]},"DOI":"10.1145\/3696410.3714806","type":"proceedings-article","created":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T16:42:02Z","timestamp":1746463322000},"page":"2530-2539","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Highly-efficient Minimization of Network Connectivity in Large-scale Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5996-3395","authenticated-orcid":false,"given":"Mingyang","family":"Zhou","sequence":"first","affiliation":[{"name":"Shenzhen University, Shenzhen, Guangdong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3141-5466","authenticated-orcid":false,"given":"Gang","family":"Liu","sequence":"additional","affiliation":[{"name":"Shenzhen University, Shenzhen, Guangdong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4617-2882","authenticated-orcid":false,"given":"Kezhong","family":"Lu","sequence":"additional","affiliation":[{"name":"Shenzhen University, Shenzhen, Guangdong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1223-6996","authenticated-orcid":false,"given":"Hao","family":"Liao","sequence":"additional","affiliation":[{"name":"Shenzhen University, Shenzhen, Guangdong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3645-5520","authenticated-orcid":false,"given":"Rui","family":"Mao","sequence":"additional","affiliation":[{"name":"Shenzhen University, Shenzhen, Guangdong, China"}]}],"member":"320","published-online":{"date-parts":[[2025,4,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3163672"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2020.03.002"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2020.12.003"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220019"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2016.06.007"},{"key":"e_1_3_2_1_6_1","volume-title":"Fast connectivity minimization on largescale networks. ACM Transactions on Knowledge Discovery from Data (TKDD), 15(3):1--25","author":"Chen C.","year":"2021","unstructured":"C. Chen, R. Peng, L. Ying, and H. Tong. Fast connectivity minimization on largescale networks. ACM Transactions on Knowledge Discovery from Data (TKDD), 15(3):1--25, 2021."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.104"},{"key":"e_1_3_2_1_8_1","first-page":"304","volume-title":"International Conference on Machine Learning","author":"Bai Wenruo","year":"2018","unstructured":"Wenruo Bai and Jeff Bilmes. Greed is still good: maximizing monotone submodular supermodular (bp) functions. In International Conference on Machine Learning, pages 304--313. PMLR, 2018."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature14604"},{"key":"e_1_3_2_1_10_1","volume-title":"Finding key players in complex networks through deep reinforcement learning. Nature machine intelligence, 2(6):317--324","author":"Fan Changjun","year":"2020","unstructured":"Changjun Fan, Li Zeng, Yizhou Sun, and Yang-Yu Liu. Finding key players in complex networks through deep reinforcement learning. Nature machine intelligence, 2(6):317--324, 2020."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974010.2"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2170849"},{"key":"e_1_3_2_1_13_1","volume-title":"Fault diameter of interconnection networks. Computers & Mathematics with Applications, 13(5--6):577--582","author":"Krishnamoorthy Mukkai S","year":"1987","unstructured":"Mukkai S Krishnamoorthy and Balaji Krishnamurthy. Fault diameter of interconnection networks. Computers & Mathematics with Applications, 13(5--6):577--582, 1987."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom.2013.51"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2014.05.073"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.045104"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.2003.1238052"},{"key":"e_1_3_2_1_19_1","volume-title":"Threshold conditions for arbitrary cascade models on arbitrary networks. Knowledge and information systems, 33(3):549--575","author":"Prakash B Aditya","year":"2012","unstructured":"B Aditya Prakash, Deepayan Chakrabarti, Nicholas C Valler, Michalis Faloutsos, and Christos Faloutsos. Threshold conditions for arbitrary cascade models on arbitrary networks. Knowledge and information systems, 33(3):549--575, 2012."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482274"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2465378"},{"key":"e_1_3_2_1_22_1","first-page":"1","volume-title":"Fractional immunization in hospital-transfer graphs","author":"Prakash B Aditya","year":"2011","unstructured":"B Aditya Prakash, Lada Adamic, Theodore Iwashyna, Hanghang Tong, and Christos Faloutsos. Fractional immunization in hospital-transfer graphs. pages 1--9, 2011."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807843"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835934"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCAS.2010.937887"},{"key":"e_1_3_2_1_27_1","volume-title":"Epidemic thresholds in real networks. ACMTransactions on Information and System Security (TISSEC), 10(4):1","author":"Chakrabarti Deepayan","year":"2008","unstructured":"Deepayan Chakrabarti, Yang Wang, Chenxi Wang, Jurij Leskovec, and Christos Faloutsos. Epidemic thresholds in real networks. ACMTransactions on Information and System Security (TISSEC), 10(4):1, 2008."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4371(02)00772-0"},{"key":"e_1_3_2_1_29_1","volume-title":"Network Science: An Introduction. High education press","author":"Wang Xiaofan","year":"2012","unstructured":"Xiaofan Wang, Xiang Li, and Guangrong Chen. Network Science: An Introduction. High education press, 2012."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.5040897"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.066133"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.111632"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1038\/nphys1746"},{"key":"e_1_3_2_1_34_1","volume-title":"Stanford InfoLab","author":"Page Lawrence","year":"1999","unstructured":"Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford InfoLab, 1999."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2018.8351133"},{"key":"e_1_3_2_1_36_1","first-page":"21350","volume-title":"International Conference on Machine Learning","author":"Ling Chen","year":"2023","unstructured":"Chen Ling, Junji Jiang, Junxiang Wang, My T Thai, Renhao Xue, James Song, Meikang Qiu, and Liang Zhao. Deep graph representation learning and optimization for influence maximization. In International Conference on Machine Learning, pages 21350--21361. PMLR, 2023."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.72"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.4922153"},{"key":"e_1_3_2_1_39_1","volume-title":"Epidemic thresholds in real networks. ACMTransactions on Information and System Security (TISSEC), 10(4):1","author":"Chakrabarti Deepayan","year":"2008","unstructured":"Deepayan Chakrabarti, Yang Wang, Chenxi Wang, Jurij Leskovec, and Christos Faloutsos. Epidemic thresholds in real networks. ACMTransactions on Information and System Security (TISSEC), 10(4):1, 2008."},{"key":"e_1_3_2_1_40_1","volume-title":"Epidemic spreading in scale-free networks. Physical review letters, 86(14):3200","author":"Pastor-Satorras Romualdo","year":"2001","unstructured":"Romualdo Pastor-Satorras and Alessandro Vespignani. Epidemic spreading in scale-free networks. Physical review letters, 86(14):3200, 2001."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.88.035006"}],"event":{"name":"WWW '25: The ACM Web Conference 2025","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Sydney NSW Australia","acronym":"WWW '25"},"container-title":["Proceedings of the ACM on Web Conference 2025"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696410.3714806","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3696410.3714806","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:42Z","timestamp":1750295922000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696410.3714806"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,22]]},"references-count":41,"alternative-id":["10.1145\/3696410.3714806","10.1145\/3696410"],"URL":"https:\/\/doi.org\/10.1145\/3696410.3714806","relation":{},"subject":[],"published":{"date-parts":[[2025,4,22]]},"assertion":[{"value":"2025-04-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}