Distance Queries in Large-Scale Fully Dynamic Complex Networks


The 2-hop cover labeling of a graph is a data structure that recently received a lot of attention since it can be exploited to efficiently answer to shortest-path distance queries on large-scale networks. In this paper, we propose the first dynamic algorithm to update 2-hop cover labelings for distance queries under edge removals, and show that: (i) it is… (More)
DOI: 10.1007/978-3-319-44543-4_9

Cite this paper

@inproceedings{DAngelo2016DistanceQI, title={Distance Queries in Large-Scale Fully Dynamic Complex Networks}, author={Gianlorenzo D'Angelo and Mattia D'Emidio and Daniele Frigioni}, booktitle={IWOCA}, year={2016} }