Finding Densest Subgraphs with Edge-Color Constraints.
Lutz Oettershagen|Honglian Wang|Aristides Gionis
| Anthology ID: | DBLP:conf/www/OettershagenWG24 |
|---|---|
| Volume: | Proceedings of the ACM on Web Conference 2024, WWW 2024, Singapore, May 13-17, 2024 |
| Year: | 2024 |
| Venue: | The Web Conference (WWW) |
| Publisher: | ACM |
| Pages: | 936-947 |
| URL: | https://doi.org/10.1145/3589334.3645647 |
| DOI: | https://doi.org/10.1145/3589334.3645647 |
| DBLP: | conf/www/OettershagenWG24 |
| BibTeX: |
@inproceedings{oettershagen-2024-finding,
author = {Lutz Oettershagen and
Honglian Wang and
Aristides Gionis},
editor = {Tat-Seng Chua and
Chong-Wah Ngo and
Ravi Kumar and
Hady Wirawan Lauw and
Roy Ka-Wei Lee},
title = {{Finding Densest Subgraphs with Edge-Color Constraints}},
booktitle = {{Proceedings of the ACM on Web Conference 2024, WWW 2024, Singapore, May 13-17, 2024}},
pages = {936--947},
publisher = {ACM},
year = {2024},
url = {https://doi.org/10.1145/3589334.3645647},
doi = {https://doi.org/10.1145/3589334.3645647}
}