Main » CIKM » 2011 » Proceedings of the 20th ACM Conference on Information and Knowledge Management, CIKM 2011, Glasgow, United Kingdom, October 24-28, 2011 »

Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs

Konstantin Tretyakov, Abel Armas-Cervantes, Luciano García-Bañuelos, Jaak Vilo, Marlon Dumas


Anthology ID:
DBLP:conf/cikm/TretyakovAGVD11
Volume:
Proceedings of the 20th ACM Conference on Information and Knowledge Management, CIKM 2011, Glasgow, United Kingdom, October 24-28, 2011
Year:
2011
Venue:
cikm_conference
Publisher:
ACM
Pages:
1785–1794
URL:
https://doi.org/10.1145/2063576.2063834
DOI:
10.1145/2063576.2063834
DBLP:
conf/cikm/TretyakovAGVD11
BibTeX:
Download