Fast top-k simple shortest paths discovery in graphs.
Jun Gao|Huida Qiu|Xiao Jiang|Tengjiao Wang|Dongqing Yang
| Anthology ID: | DBLP:conf/cikm/GaoQJWY10 |
|---|---|
| Volume: | Proceedings of the 19th ACM Conference on Information and Knowledge Management, CIKM 2010, Toronto, Ontario, Canada, October 26-30, 2010 |
| Year: | 2010 |
| Venue: | International Conference on Information and Knowledge Management (CIKM) |
| Publisher: | ACM |
| Pages: | 509-518 |
| URL: | https://doi.org/10.1145/1871437.1871504 |
| DOI: | https://doi.org/10.1145/1871437.1871504 |
| DBLP: | conf/cikm/GaoQJWY10 |
| BibTeX: |
@inproceedings{gao-2010-fast,
author = {Jun Gao and
Huida Qiu and
Xiao Jiang and
Tengjiao Wang and
Dongqing Yang},
editor = {Jimmy Huang and
Nick Koudas and
Gareth J. F. Jones and
Xindong Wu and
Kevyn Collins-Thompson and
Aijun An},
title = {{Fast top-k simple shortest paths discovery in graphs}},
booktitle = {{Proceedings of the 19th ACM Conference on Information and Knowledge Management, CIKM 2010, Toronto, Ontario, Canada, October 26-30, 2010}},
pages = {509--518},
publisher = {ACM},
year = {2010},
url = {https://doi.org/10.1145/1871437.1871504},
doi = {https://doi.org/10.1145/1871437.1871504}
}