Fast top-k simple shortest paths discovery in graphs.
https://doi.org/10.1145/1871437.1871504
@inproceedings{DBLP:conf/cikm/GaoQJWY10,
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 = {10.1145/1871437.1871504},
timestamp = {Mon, 07 Jan 2019 17:17:42 +0100},
biburl = {https://dblp.org/rec/conf/cikm/GaoQJWY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
本页面没有标签