Maintaining Densest Subsets Efficiently in Evolving Hypergraphs.
Shuguang Hu|Xiaowei Wu|T.-H. Hubert Chan
| Anthology ID: | DBLP:conf/cikm/HuWC17 |
|---|---|
| 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: | 929-938 |
| URL: | https://doi.org/10.1145/3132847.3132907 |
| DOI: | https://doi.org/10.1145/3132847.3132907 |
| DBLP: | conf/cikm/HuWC17 |
| BibTeX: |
@inproceedings{hu-2017-maintaining,
author = {Shuguang Hu and
Xiaowei Wu and
T.-H. Hubert Chan},
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 = {{Maintaining Densest Subsets Efficiently in Evolving Hypergraphs}},
booktitle = {{Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, CIKM 2017, Singapore, November 06 - 10, 2017}},
pages = {929--938},
publisher = {ACM},
year = {2017},
url = {https://doi.org/10.1145/3132847.3132907},
doi = {https://doi.org/10.1145/3132847.3132907}
}