Back to Results
First PageMeta Content
Network theory / Network flow / Graph / Shortest path problem / Tree / Reachability / Connectivity / Distance / Flow network / Graph theory / Mathematics / Theoretical computer science


A Sketch-Based Distance Oracle for Web-Scale Graphs Atish Das Sarma Sreenivas Gollapudi Marc Najork
Add to Reading List

Document Date: 2009-12-30 02:03:16


Open Document

File Size: 574,21 KB

Share Result on Facebook

City

New York City / /

Company

MIT Press / McGraw-Hill / J. Comp / Israel Journal / Microsoft / /

Country

United States / /

Currency

USD / /

/

Facility

Web-Scale Graphs Atish Das Sarma Sreenivas Gollapudi Marc Najork Georgia Institute of Technology Atlanta / Scalable Hyperlink Store / /

IndustryTerm

online computation / Online-Common-Seed / Online-Common-Seed We / online distance computations / web graph containing billions / upper-bound algorithm / social networking sites / breadth-first-search crawl / algorithms Online-Common-Seed / large web graphs / breadth-first search crawl starting / road networks / well known shortest-path algorithm / real time / large web graph / Online-Bourgain We / online step / shortest path algorithms / similarity search / online lookup / offline sketch computing phase / crawled web pages / straightforward brute force solution / online computations / algorithm Online-Common-Seed / suggested algorithms / web-scale graph / Online-Common-Seed As / rithm Online-Common-Seed / Online-Common-Seed We note / Online-Bourgain The algorithm / algorithm Online-CommonSeed / distance estimation algorithm / constant processing time / search engines / online algorithm / web graph containing tens / lower bound algorithm / online phase / web graph / Online-Bourgain / Point-to-point shortest path algorithms / social networks / social network / online distance computation algorithm / same theoretical guarantee /

Organization

MIT / Web-Scale Graphs Atish Das Sarma Sreenivas Gollapudi Marc Najork Georgia Institute of Technology Atlanta / /

Person

Kai Li / Mark S. Manasse / Luh Yen / David Peleg / David Ilcinkas / Moses Charikar / Wei Dong / Jittat Fakcharoenphol / Amos Korman / Ronald L. Rivest / Uri Zwick / Haim Kaplan / Kunal Talwar / Andrew McGregor / Andrew V. Goldberg / Pierre Fraigniaud / Charles E. Leiserson / Amin Mantrach / Michal Katz / Thomas H. Cormen / Eran Halperin / Jian Zhang / Masashi Shimbo / Marco Saerens / Sampath Kannan / Camil Demetrescu / Steven C. Glassman / Nir A. Katz / David S. Johnson / Alain Pirotte / Cyril Gavoille / Andrei Z. Broder / Joan Feigenbaum / Siddharth Suri / Edith Cohen / Reuven Cohen / Jiri Matousek / Mikkel Thorup / Jean-Michel Renders / Satish Rao / Jean Bourgain / Marc Najork / /

Position

path and circuit problems General / Instant Messenger / /

Product

Scalable Hyperlink Store / /

ProvinceOrState

New York / /

Technology

online algorithm / previously suggested algorithms / upper-bound algorithm / efficient algorithms / 404 Algorithm / undirected algorithm / lower bound algorithm / known sketching algorithm / 403 Algorithm / shortest path algorithms / directed algorithms / Point-to-point shortest path algorithms / Graph algorithms / distance estimation algorithm / main algorithm / also 402 Algorithm / GENERALIZATION TO DIRECTED GRAPHS The algorithms / Online-Bourgain The algorithm / undirected algorithms / sketching algorithm / online distance computation algorithm / same algorithm / well known shortest-path algorithm / Streaming algorithm / /

URL

www.yahoo.com / /

SocialTag