Fully Dynamic Shortest-Path Distance Query Acceleration on Massive Networks.
Takanori Hayashi|Takuya Akiba|Ken-ichi Kawarabayashi
| Anthology ID: | DBLP:conf/cikm/0002AK16 |
|---|---|
| Volume: | Proceedings of the 25th ACM International Conference on Information and Knowledge Management, CIKM 2016, Indianapolis, IN, USA, October 24-28, 2016 |
| Year: | 2016 |
| Venue: | International Conference on Information and Knowledge Management (CIKM) |
| Publisher: | ACM |
| Pages: | 1533-1542 |
| URL: | https://doi.org/10.1145/2983323.2983731 |
| DOI: | https://doi.org/10.1145/2983323.2983731 |
| DBLP: | conf/cikm/0002AK16 |
| BibTeX: |
@inproceedings{hayashi-2016-fully,
author = {Takanori Hayashi and
Takuya Akiba and
Ken-ichi Kawarabayashi},
editor = {Snehasis Mukhopadhyay and
ChengXiang Zhai and
Javed Mostafa and
Elisa Bertino and
Fabio Crestani and
Javed Mostafa and
Jie Tang and
Luo Si and
Xiaofang Zhou and
Yi Chang and
Yunyao Li and
Parikshit Sondhi},
title = {{Fully Dynamic Shortest-Path Distance Query Acceleration on Massive Networks}},
booktitle = {{Proceedings of the 25th ACM International Conference on Information and Knowledge Management, CIKM 2016, Indianapolis, IN, USA, October 24-28, 2016}},
pages = {1533--1542},
publisher = {ACM},
year = {2016},
url = {https://doi.org/10.1145/2983323.2983731},
doi = {https://doi.org/10.1145/2983323.2983731}
}