Mingyang Zhou 0001, Gang Liu 0028, Kezhong Lu, Hao Liao, Rui Mao 0001. Highly-efficient Minimization of Network Connectivity in Large-scale Graphs. In Guodong Long, Michale Blumestein, Yi Chang 0001, Liane Lewin-Eytan, Zi Helen Huang, Elad Yom-Tov, editors, Proceedings of the ACM on Web Conference 2025, WWW 2025, Sydney, NSW, Australia, 28 April 2025- 2 May 2025. pages 2530-2539, ACM, 2025. [doi]
@inproceedings{0001LLL025,
title = {Highly-efficient Minimization of Network Connectivity in Large-scale Graphs},
author = {Mingyang Zhou 0001 and Gang Liu 0028 and Kezhong Lu and Hao Liao and Rui Mao 0001},
year = {2025},
doi = {10.1145/3696410.3714806},
url = {https://doi.org/10.1145/3696410.3714806},
researchr = {https://researchr.org/publication/0001LLL025},
cites = {0},
citedby = {0},
pages = {2530-2539},
booktitle = {Proceedings of the ACM on Web Conference 2025, WWW 2025, Sydney, NSW, Australia, 28 April 2025- 2 May 2025},
editor = {Guodong Long and Michale Blumestein and Yi Chang 0001 and Liane Lewin-Eytan and Zi Helen Huang and Elad Yom-Tov},
publisher = {ACM},
isbn = {979-8-4007-1274-6},
}