Fast and accurate estimation of shortest paths in large graphs (2010)

by Andrey Gubichev , Srikanta Bedathur , Stephan Seufert , Gerhard Weikum
Venue:In Proceedings of Conference on Information and Knowledge Management (CIKM
Citations:9 - 0 self

Documents Related by Co-Citation

16 A Sketch-Based Distance Oracle for Web-Scale Graphs – Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy, Marc Najork
24 Fast shortest path distance estimation in large networks – Michalis Potamias, Carlos Castillo, Francesco Bonchi, Aristides Gionis - 2009
345 Measurement and Analysis of Online Social Networks – Alan Mislove, Massimiliano Marcon, Krishna P. Gummadi, Peter Druschel, Bobby Bhattacharjee - 2007
210 Approximate distance oracles – Mikkel Thorup, Uri Zwick
97 Computing the shortest path: A* search meets graph theory – Andrew V. Goldberg, Chris Harrelson - 2005
8 shortest path estimation for large social graphs – Orion - 2010
13 Do Social Networks Improve e-Commerce? A Study on Social Marketplaces – Gayatri Swamynathan, Christo Wilson, Bryce Boe, Kevin Almeroth, Ben Y. Zhao
170 Pregel: A system for large-scale graph processing – Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, Grzegorz Czajkowski, Google Inc - 2010
12 TEDI: efficient shortest path query answering on graphs – F Wei - 2010
42 D.: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks – R Geisberger, P Sanders, D Schultes, Delling - 2008
45 An Analysis of Social Network-Based Sybil Defenses ABSTRACT – Bimal Viswanath, Krishna P. Gummadi, Ansley Post, Alan Mislove
21 Computing the shortest path: A ⋆ meets graph theory – A Goldberg, C Harrelson - 2005
60 Reach for A∗: Efficient point-to-point shortest path algorithms – Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck - 2006
7 Network Dataset Collection: http://snap.stanford.edu/data/index.html – Stanford Large
7 Approximate Distance Queries and Compact Routing in Sparse Graphs – Rachit Agarwal, P. Brighten Godfrey, Sariel Har-peled
3 Efficient Shortest Paths on Massive Social Graphs – Xiaohan Zhao, Ra Sala, Haitao Zheng, Ben Y. Zhao
4 Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs – Konstantin Tretyakov, Jaak Vilo, Abel Armas-cervantes, Marlon Dumas, Luciano García-bañuelos - 2011
47 Yes, there is a correlation - from social networks to personal behavior on the web – Parag Singla, Matthew Richardson - 2008
20 Efficient network aware search in collaborative tagging sites – Sihem Amer-Yahia, Michael Benedikt, Laks V S Lakshmanan, Julia Stoyanovich - 2008