Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Orion: Shortest Path Estimation for Large Social Graphs Xiaohan Zhao, Alessandra Sala, Christo Wilson, Haitao Zheng and Ben Y. Zhao
 

Summary: Orion: Shortest Path Estimation for Large Social Graphs
Xiaohan Zhao, Alessandra Sala, Christo Wilson, Haitao Zheng and Ben Y. Zhao
Department of Computer Science, UC Santa Barbara, USA
{xiaohanzhao, alessandra, bowlin, htzheng, ravenben}@cs.ucsb.edu
Abstract
Through measurements, researchers continue to produce
large social graphs that capture relationships, transac-
tions, and social interactions between users. Efficient
analysis of these graphs requires algorithms that scale
well with graph size. We examine node distance com-
putation, a critical primitive in graph problems such as
computing node separation, centrality computation, mu-
tual friend detection, and community detection. For
large million-node social graphs, computing even a sin-
gle shortest path using traditional breadth-first-search
can take several seconds.
In this paper, we propose a novel node distance esti-
mation mechanism that effectively maps nodes in high
dimensional graphs to positions in low-dimension Eu-
clidean coordinate spaces, thus allowing constant time

  

Source: Almeroth, Kevin C. - Department of Computer Science, University of California at Santa Barbara

 

Collections: Computer Technologies and Information Sciences