Fully Dynamic Algorithm for Top-k Densest Subgraphs.
Muhammad Anis Uddin Nasir|Aristides Gionis|Gianmarco De Francisci Morales|Sarunas Girdzijauskas
| Anthology ID: | DBLP:conf/cikm/NasirGMG17 |
|---|---|
| Volume: | Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, CIKM 2017, Singapore, November 06 - 10, 2017 |
| Year: | 2017 |
| Venue: | International Conference on Information and Knowledge Management (CIKM) |
| Publisher: | ACM |
| Pages: | 1817-1826 |
| URL: | https://doi.org/10.1145/3132847.3132966 |
| DOI: | https://doi.org/10.1145/3132847.3132966 |
| DBLP: | conf/cikm/NasirGMG17 |
| BibTeX: |
@inproceedings{nasir-2017-fully,
author = {Muhammad Anis Uddin Nasir and
Aristides Gionis and
Gianmarco De Francisci Morales and
Sarunas Girdzijauskas},
editor = {Ee-Peng Lim and
Marianne Winslett and
Mark Sanderson and
Ada Wai-Chee Fu and
Jimeng Sun and
J. Shane Culpepper and
Eric Lo and
Joyce C. Ho and
Debora Donato and
Rakesh Agrawal and
Yu Zheng and
Carlos Castillo and
Aixin Sun and
Vincent S. Tseng and
Chenliang Li},
title = {{Fully Dynamic Algorithm for Top-k Densest Subgraphs}},
booktitle = {{Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, CIKM 2017, Singapore, November 06 - 10, 2017}},
pages = {1817--1826},
publisher = {ACM},
year = {2017},
url = {https://doi.org/10.1145/3132847.3132966},
doi = {https://doi.org/10.1145/3132847.3132966}
}