A Sketch-Based Distance Oracle for Web-Scale Graphs

by Atish Das Sarma , Sreenivas Gollapudi , Rina Panigrahy , Marc Najork
Citations:16 - 1 self

Active Bibliography

7 Communication Algorithms with Advice – Pierre Fraigniaud , David Ilcinkas, Andrzej Pelc - 2009
Oracle Size: A new measure of . . . – Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc - 2006
Shortest-Path Queries for Complex Networks: Exploiting Low Tree-width Outside the Core – Takuya Akiba, Christian Sommer, Ken-ichi Kawarabayashi
27 Labeling schemes for small distances in trees – Stephen Alstrup, Philip Bille, Theis Rauhe - 2003
6 Spanners with slack – T. -h. Hubert Chan, Michael Dinitz, Anupam Gupta - 2006
Project Summary – unknown authors
210 Approximate distance oracles – Mikkel Thorup, Uri Zwick
Multiplicative approximations of random walk transition probabilities – Michael Kapralov, Rina Panigrahy - 2011
Fully Dynamic Randomized Algorithms for Graph Spanners ∗ – Surender Baswana, Sumeet Khurana, Soumojit Sarkar
1 Fast constructions of light-weight spanners for general graphs – Michael Elkin, Shay Solomon - 2013
10 Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners – Michael Elkin - 2007
7 Distributed Algorithms for Ultrasparse Spanners and Linear Size Skeletons – Seth Pettie
Second Reader – Michalis Potamias, Michalis Potamias, George Kollios Phd, Stan Sclaroff Phd, Robert Baden-powell
24 Fast shortest path distance estimation in large networks – Michalis Potamias, Carlos Castillo, Francesco Bonchi, Aristides Gionis - 2009
16 Labeling Schemes for Dynamic Tree Networks – Amos Korman, David Peleg, Yoav Rodeh - 2002
13 General Compact Labeling Schemes for Dynamic Trees – Amos Korman - 2005
16 Labeling Schemes for Weighted Dynamic Trees – Amos Korman, David Peleg - 2003
8 Labeling Schemes for Vertex Connectivity – Amos Korman
6 Constructing Labeling schemes through Universal Matrices – Amos Korman, David Peleg, Yoav Rodeh - 2006