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. Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs. In Craig Macdonald, Iadh Ounis, Ian Ruthven, editors, Proceedings of the 20th ACM Conference on Information and Knowledge Management, CIKM 2011, Glasgow, United Kingdom, October 24-28, 2011. pages 1785-1794, ACM, 2011. [doi]

Abstract

Abstract is missing.