Highly-efficient Minimization of Network Connectivity in Large-scale Graphs.
Mingyang Zhou|Gang Liu|Kezhong Lu|Hao Liao|Rui Mao
| Anthology ID: | DBLP:conf/www/0001LLL025 |
|---|---|
| Volume: | Proceedings of the ACM on Web Conference 2025, WWW 2025, Sydney, NSW, Australia, 28 April 2025- 2 May 2025 |
| Year: | 2025 |
| Venue: | The Web Conference (WWW) |
| Publisher: | ACM |
| Pages: | 2530-2539 |
| URL: | https://doi.org/10.1145/3696410.3714806 |
| DOI: | https://doi.org/10.1145/3696410.3714806 |
| DBLP: | conf/www/0001LLL025 |
| BibTeX: |
@inproceedings{zhou-2025-highlyefficient,
author = {Mingyang Zhou and
Gang Liu and
Kezhong Lu and
Hao Liao and
Rui Mao},
editor = {Guodong Long and
Michale Blumestein and
Yi Chang and
Liane Lewin-Eytan and
Zi Huang and
Elad Yom-Tov},
title = {{Highly-efficient Minimization of Network Connectivity in Large-scale Graphs}},
booktitle = {{Proceedings of the ACM on Web Conference 2025, WWW 2025, Sydney, NSW, Australia, 28 April 2025- 2 May 2025}},
pages = {2530--2539},
publisher = {ACM},
year = {2025},
url = {https://doi.org/10.1145/3696410.3714806},
doi = {https://doi.org/10.1145/3696410.3714806}
}