Abstract
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 efficient in terms of the number of nodes that change their distance toward some other node of the network, as a consequence of an edge removal; (ii) it is able to preserve the minimality of the labeling, a desirable property that has impact on both size and query time. In addition, we combine the new method with the unique algorithm in the literature suitable to handle edge additions, thus obtaining the first fully dynamic algorithm for updating 2-hop cover labelings for distance queries. We also conduct an extensive experimental study on real and synthetic dynamic networks, to show the scalability and efficiency of our new methods.
Research partially supported by the Italian Ministry of University and Research under the Research Grant 2012C4E3KT PRIN 2012 “AMANDA” (Algorithmics for MAssive and Networked DAta).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Hierarchical hub labelings for shortest paths. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 24–35. Springer, Heidelberg (2012)
Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: Proceedings of International Conference on Management of Data (SIGMOD 2013), pp. 349–360. ACM (2013)
Akiba, T., Iwata, Y., Yoshida, Y.: Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling. In: Proceedings of 23rd International World Wide Web Conference (WWW 2014), pp. 237–248. ACM (2014)
Boccaletti, S., Latora, V., Moreno, Y., Chavez, M., Hwang, D.U.: Complex networks: structure and dynamics. Phys. Rep. 424(4–5), 175–308 (2006)
Bruera, F., Cicerone, S., D’Angelo, G., Stefano, G.D., Frigioni, D.: Dynamic multi-level overlay graphs for shortest paths. Math. Comput. Sci. 1(4), 709–736 (2008)
Cionini, A., D’Angelo, G., D’Emidio, M., Frigioni, D., Giannakopoulou, K., Paraskevopoulos, A., Zaroliagis, C.D.: Engineering graph-based models for dynamic timetable information systems. In: ATMOS. OASICS, vol. 42, pp. 46–61. Schloss Dagstuhl (2014)
Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. In: Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 937–946. ACM/SIAM (2002)
D’Angelo, G., D’Emidio, M., Frigioni, D.: Fully dynamic update of arc-flags. Networks 63(3), 243–259 (2014)
Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Robust distance queries on massive networks. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 321–333. Springer, Heidelberg (2014)
Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Customizable route planning. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 376–387. Springer, Heidelberg (2011)
Delling, D., Goldberg, A.V., Savchenko, R., Werneck, R.F.: Hub labels: theory and practice. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 259–270. Springer, Heidelberg (2014)
Delling, D., Italiano, G.F., Pajor, T., Santaroni, F.: Better transit routing by exploiting vehicle GPS data. In: Proceedings of the 7th SIGSPATIAL International Workshop on Computational Transportation Science (IWCTS 2014), pp. 31–40. ACM (2014)
Jin, R., Ruan, N., Xiang, Y., Lee, V.E.: A highway-centric labeling approach for answering distance queries on large sparse graphs. In: Proceedings of International Conference on Management of Data (SIGMOD 2012), pp. 445–456. ACM (2012)
Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. In: Proceedings of 18th ACM Conference on Information and Knowledge Management (CIKM 2009), pp. 867–876. ACM (2009)
Qin, Y., Sheng, Q.Z., Zhang, W.E.: SIEF: efficiently answering distance queries for failure prone graphs. In: Proceedings of the 18th International Conference on Extending Database Technology (EDBT 2015), pp. 145–156. OpenProceedings.org (2015)
Vieira, M.V., Fonseca, B.M., Damazio, R., Golgher, P.B., de Castro Reis, D., Ribeiro-Neto, B.A.: Efficient search ranking in social networks. In: Proceedings of the 16th Conference on Information and Knowledge Management (CIKM 2007), pp. 563–572. ACM (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
D’Angelo, G., D’Emidio, M., Frigioni, D. (2016). Distance Queries in Large-Scale Fully Dynamic Complex Networks. In: Mäkinen, V., Puglisi, S., Salmela, L. (eds) Combinatorial Algorithms. IWOCA 2016. Lecture Notes in Computer Science(), vol 9843. Springer, Cham. https://doi.org/10.1007/978-3-319-44543-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-44543-4_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-44542-7
Online ISBN: 978-3-319-44543-4
eBook Packages: Computer ScienceComputer Science (R0)