Abstract
In this paper, we study the problem of point-to-point shortest path query in massive complex networks. Nowadays a breadth first search in a network containing millions of vertices may cost a few seconds and it can not meet the demands of real-time applications. Some existing landmark-based methods have been proposed to solve this problem in sacrifice of precision. However, their query precision and efficiency is not high enough. We first present a notion of navigator, which is a data structure constructed from the input network. Then navigation algorithm based on the navigator is proposed to solve this problem. It effectively navigates a path only using local information of each vertex by interacting with navigator. We conduct extensive experiments in massive real-world networks containing hundreds of millions of vertices. The results demonstrate the efficiency of our methods. Compared with previous methods, ours can navigate a shortest path with higher probability in less time.
This work is supported by the National Basic Research Program of China No.2014CB340302 and the National Nature Science Foundation of China No.61772503.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Konect network dataset (2017). http://konect.uni-koblenz.de
Backstrom, L., Huttenlocher, D.P., Kleinberg, J.M., Lan, X.: Group formation in large social networks: membership, growth, and evolution. In: Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, USA, 20–23 August 2006, pp. 44–54 (2006)
Boldi, P., Rosa, M., Santini, M., Vigna, S.: Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. In: Srinivasan, S., Ramamritham, K., Kumar, A., Ravindra, M.P., Bertino, E., Kumar, R. (eds.) Proceedings of the 20th International Conference on World Wide Web, pp. 587–596. ACM Press (2011)
Boldi, P., Vigna, S.: The WebGraph framework I: compression techniques. In: Proceedings of the Thirteenth International World Wide Web Conference (WWW 2004), pp. 595–601. ACM Press, Manhattan, USA (2004)
Chechik, S.: Approximate distance oracles with constant query time. In: Symposium on Theory of Computing, STOC 2014, New York, NY, USA, 31 May–03 June 2014, pp. 654–663 (2014)
Cheng, J., Zhang, Y., Ye, Q., Du, H.: High-precision shortest distance estimation for large-scale social networks. In: 35th Annual IEEE International Conference on Computer Communications, INFOCOM 2016, San Francisco, CA, USA, 10–14 April 2016, pp. 1–9 (2016)
Cohen-Addad, V., Dahlgaard, S., Wulff-Nilsen, C.: Fast and compact exact distance oracle for planar graphs. In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, 15–17 October 2017, pp. 962–973 (2017)
Derungs, J., Jacob, R., Widmayer, P.: Approximate shortest paths guided by a small index. Algorithmica 57(4), 668–688 (2010)
Gawrychowski, P., Mozes, S., Weimann, O., Wulff-Nilsen, C.: Better tradeoffs for exact distance oracles in planar graphs. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, 7–10 January 2018, pp. 515–529 (2018)
Goldberg, A.V., Harrelson, C.: Computing the shortest path: a search meets graph theory. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, 23–25 January 2005, pp. 156–165 (2005)
Gubichev, A., Bedathur, S.J., Seufert, S., Weikum, G.: Fast and accurate estimation of shortest paths in large graphs. In: Proceedings of the 19th ACM Conference on Information and Knowledge Management, CIKM 2010, Toronto, Ontario, Canada, 26–30 October 2010, pp. 499–508 (2010)
Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection, June 2014. http://snap.stanford.edu/data
Maue, J., Sanders, P., Matijevic, D.: Goal-directed shortest-path queries using precomputed cluster distances. ACM J. Exp. Algor. 14, 27 pages (2009). Article 3.2
Möhring, R.H., Schilling, H., Schütz, B., Wagner, D., Willhalm, T.: Partitioning graphs to speed up Dijkstra’s Algorithm. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 189–202. Springer, Heidelberg (2005). https://doi.org/10.1007/11427186_18
Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM 2009, Hong Kong, China, 2–6 November 2009, pp. 867–876 (2009)
Qiao, M., Cheng, H., Chang, L., Yu, J.X.: Approximate shortest distance computing: a query-dependent local landmark scheme. In: IEEE 28th International Conference on Data Engineering (ICDE 2012), Washington, DC, USA (Arlington, Virginia), 1–5 April, 2012, pp. 462–473 (2012)
Rahman, S.A., Schomburg, D.: Observing local and global properties of metabolic pathways: “load points” and “choke points” in the metabolic networks. Bioinformatics 22(14), 1767–1774 (2006)
Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization (2015). http://networkrepository.com
Thorup, M., Zwick, U.: Approximate distance oracles. J. ACM 52(1), 1–24 (2005)
Tretyakov, K., Armas-Cervantes, A., García-Bañuelos, L., Vilo, J., Dumas, M.: Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs. In: Proceedings of the 20th ACM Conference on Information and Knowledge Management, CIKM 2011, Glasgow, United Kingdom, 24–28 October 2011, pp. 1785–1794 (2011)
Wulff-Nilsen, C.: Approximate distance oracles with improved query time. In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, 6–8 January 2013, pp. 539–549 (2013)
Zhao, X., Sala, A., Zheng, H., Zhao, B.Y.: Efficient shortest paths on massive social graphs. In: 7th International Conference on Collaborative Computing: Networking, Applications and Worksharing, CollaborateCom 2011, Orlando, FL, USA, 15–18 October 2011, pp. 77–86 (2011)
Zhao, X., Zheng, H.: Orion: shortest path estimation for large social graphs. In: 3rd Workshop on Online Social Networks, WOSN 2010, Boston, MA, USA, 22 June 2010 (2010)
Zhou, C., Lu, W., Zhang, P., Wu, J., Hu, Y., Guo, L.: On the minimum differentially resolving set problem for diffusion source inference in networks. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, Phoenix, Arizona, USA, 12–17 February 2016, pp. 79–86 (2016)
Zhu, K., Ying, L.: Information source detection in the SIR model: a sample-path-based approach. IEEE/ACM Trans. Netw. 24(1), 408–421 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Liu, J., Pan, Y., Hu, Q., Li, A. (2019). Navigating a Shortest Path with High Probability in Massive Complex Networks. In: Kotsireas, I., Pardalos, P., Parsopoulos, K., Souravlias, D., Tsokas, A. (eds) Analysis of Experimental Algorithms. SEA 2019. Lecture Notes in Computer Science(), vol 11544. Springer, Cham. https://doi.org/10.1007/978-3-030-34029-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-34029-2_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-34028-5
Online ISBN: 978-3-030-34029-2
eBook Packages: Computer ScienceComputer Science (R0)