Fast and accurate estimation of shortest paths in large graphs.

Andrey Gubichev|Srikanta J. Bedathur|Stephan Seufert|Gerhard Weikum


Anthology ID:DBLP:conf/cikm/GubichevBSW10
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:499-508
URL:https://doi.org/10.1145/1871437.1871503
DOI:https://doi.org/10.1145/1871437.1871503
DBLP:conf/cikm/GubichevBSW10
BibTeX:
@inproceedings{gubichev-2010-fast, author = {Andrey Gubichev and Srikanta J. Bedathur and Stephan Seufert and Gerhard Weikum}, editor = {Jimmy Huang and Nick Koudas and Gareth J. F. Jones and Xindong Wu and Kevyn Collins-Thompson and Aijun An}, title = {{Fast and accurate estimation of shortest paths in large graphs}}, booktitle = {{Proceedings of the 19th ACM Conference on Information and Knowledge Management, CIKM 2010, Toronto, Ontario, Canada, October 26-30, 2010}}, pages = {499--508}, publisher = {ACM}, year = {2010}, url = {https://doi.org/10.1145/1871437.1871503}, doi = {https://doi.org/10.1145/1871437.1871503} }