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:International Conference on Information and Knowledge Management (CIKM)
Publisher:ACM
Pages:1785-1794
URL:https://doi.org/10.1145/2063576.2063834
DOI:https://doi.org/10.1145/2063576.2063834
DBLP:conf/cikm/TretyakovAGVD11
BibTeX:
@inproceedings{tretyakov-2011-fast, author = {Konstantin Tretyakov and Abel Armas-Cervantes and Luciano Garc\'{i}a-Ba\~{n}uelos and Jaak Vilo and Marlon Dumas}, editor = {Craig Macdonald and Iadh Ounis and Ian Ruthven}, title = {{Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs}}, booktitle = {{Proceedings of the 20th ACM Conference on Information and Knowledge Management, CIKM 2011, Glasgow, United Kingdom, October 24-28, 2011}}, pages = {1785--1794}, publisher = {ACM}, year = {2011}, url = {https://doi.org/10.1145/2063576.2063834}, doi = {https://doi.org/10.1145/2063576.2063834} }