Konstantin Tretyakov
Marlon Dumas
ABSTRACT
Computing the shortest path between a pair of vertices in a graph is a fundamental primitive in graph algorithmics. Classical exact methods for this problem do not scale up to contemporary, rapidly evolving social networks with hundreds of millions of users and billions of connections. A number of approximate methods have been proposed, including several landmark-based methods that have been shown to scale up to very large graphs with acceptable accuracy. This paper presents two improvements to existing landmark-based shortest path estimation methods. The first improvement relates to the use of shortest-path trees (SPTs). Together with appropriate short-cutting heuristics, the use of SPTs allows to achieve higher accuracy with acceptable time and memory overhead. Furthermore, SPTs can be maintained incrementally under edge insertions and deletions, which allows for a fully-dynamic algorithm. The second improvement is a new landmark selection strategy that seeks to maximize the coverage of all shortest paths by the selected landmarks. The improved method is evaluated on the DBLP, Orkut, Twitter and Skype social networks.
- D. A. Bader, S. Kintali, K. Madduri, and M. Mihail. Approximating betweenness centrality. In Proceedings of the 5th international conference on Algorithms and models for the web-graph, WAW'07, pages 124--137, Berlin, Heidelberg, 2007. Springer-Verlag. Google Scholar
Digital Library
- U. Brandes. A faster algorithm for betweenness centrality, 2001.Google Scholar
- E. P. F. Chan and Y. Yang. Shortest path tree computation in dynamic graphs. IEEE Trans. Comput., 58(4):541--557, 2009. Google ScholarDigital Library
- L. J. Cowen and C. G. Wagner. Compact roundtrip routing in directed networks. Journal of Algorithms, 50(1):79 -- 95, 2004. Google ScholarDigital Library
- A. Das Sarma, S. Gollapudi, M. Najork, and R. Panigrahy. A sketch-based distance oracle for web-scale graphs. In Proceedings of the third ACM international conference on Web search and data mining, WSDM '10, pages 401--410, New York, NY, USA, 2010. ACM. Google ScholarDigital Library
- D. Frigioni. Fully dynamic algorithms for maintaining shortest path trees, 2000.Google Scholar
- A. V. Goldberg and C. Harrelson. Computing the shortest path: A* search meets graph theory. In Proc. 16th ACM-SIAM Symposium on Discrete Algorithms, pages 156--165, 2005. Google ScholarDigital Library
- A. V. Goldberg, H. Kaplan, and R. F. Werneck. Abstract reach for A*: Efficient point-to-point shortest path algorithms, 2006.Google Scholar
- A. Gubichev, S. J. Bedathur, S. Seufert, and G. Weikum. Fast and accurate estimation of shortest paths in large graphs. In CIKM '10: Proceeding of the 19th ACM conference on Information and knowledge management, pages 499--508. ACM, 2010. Google ScholarDigital Library
- T. Ikeda, M.-Y. Hsu, H. Imai, S. Nishimura, H. Shimoura, T. Hashimoto, K. Tenmoku, and K. Mitoh. A fast algorithm for finding better routes by ai search techniques. In Proc. Vehicle Navigation and Information Systems Conf., pages 291--296, 1994.Google ScholarCross Ref
- J. Kleinberg, A. Slivkins, and T. Wexler. Triangulation and embedding using small sets of beacons. In Proc. 45th Annual IEEE Symp. Foundations of Computer Science, pages 444--453, 2004. Google ScholarDigital Library
- H. Kwak, C. Lee, H. Park, and S. Moon. What is Twitter, a social network or a news media? In WWW '10: Proceedings of the 19th international conference on World wide web, pages 591--600, New York, NY, USA, 2010. ACM. Google ScholarDigital Library
- M. Ley and P. Reuther. Maintaining an online bibliographical database: the problem of data quality. in egc, ser. revue des nouvelles technologies de l'information, vol. rnti-e-6. Cépadués Éditions, 2006:5--10, 2006.Google Scholar
- A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and Analysis of Online Social Networks. In Proceedings of the 5th ACM/Usenix Internet Measurement Conference (IMC'07), San Diego, CA, October 2007. Google ScholarDigital Library
- I. Pohl. Bi-directional search. In D. Meltzer, Bernard; Michie, editor, Machine Intelligence. Edinburgh University Press, 1971.Google Scholar
- M. Potamias, F. Bonchi, C. Castillo, and A. Gionis. Fast shortest path distance estimation in large networks. In CIKM '09: Proceeding of the 18th ACM conference on Information and knowledge management, pages 867--876, New York, NY, USA, 2009. ACM. Google ScholarDigital Library
- M. Thorup and U. Zwick. Approximate distance oracles. In Proceedings of the thirty-third annual ACM symposium on Theory of computing, STOC '01, pages 183--192, New York, NY, USA, 2001. ACM. Google ScholarDigital Library
- M. V. Vieira, B. M. Fonseca, R. Damazio, P. B. Golgher, D. d. C. Reis, and B. Ribeiro-Neto. Efficient search ranking in social networks. In Proceedings of the sixteenth ACM conference on Conference on information and knowledge management, CIKM '07, pages 563--572, New York, NY, USA, 2007. ACM. Google ScholarDigital Library
- D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393(6684):440--442, Jun 1998.Google ScholarCross Ref
- X. Zhao, A. Sala, C. Wilson, H. Zheng, and B. Y. Zhao. Orion: shortest path estimation for large social graphs. In Proceedings of the 3rd conference on Online social networks, WOSN'10, pages 9--9, Berkeley, CA, USA, 2010. USENIX Association. Google ScholarDigital Library
- U. Zwick. Exact and approximate distances in graphs -- a survey. In ESA '01: 9th Annual European Symposium on Algorithms, pages 33--48. Springer, 2001. Google ScholarDigital Library
Index Terms
- Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs
Recommendations
Fast and accurate estimation of shortest paths in large graphs
CIKM '10: Proceedings of the 19th ACM international conference on Information and knowledge managementComputing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a number of techniques exist for answering reachability queries and approximating ...
Label constrained shortest path estimation
CIKM '13: Proceedings of the 22nd ACM international conference on Information & Knowledge ManagementShortest path querying is a fundamental graph problem which is computationally quite challenging when operating over massive scale graphs. Recent results have addressed the problem of computing either exact or good approximate shortest path distances ...
Adaptive Landmark Selection Strategies for Fast Shortest Path Computation in Large Real-World Graphs
WI-IAT '14: Proceedings of the 2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT) - Volume 01This paper considers the task of answering shortest path queries in large real-world graphs such as social networks, communication networks and web graphs. The traditional Breadth First Search (BFS) approach for solving this problem is too time-...
Comments