Zhao, Xiaohan and Sala, Alessandra and Zheng, Haitao and Zhao, Ben (2012) Efficient Shortest Paths on Massive Social Graphs. In: 7th International Conference on Collaborative Computing: Networking, Applications and Worksharing.
![[thumbnail of 13178.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "13178.pdf")
PDF
13178.pdf
Download (225kB)
Abstract
Analysis of large networks is a critical component of many of today’s application environments. The arrival of massive network graphs with hundreds of millions of nodes, e.g. social graphs, presents a unique challenge to graph analysis applications. Most of these applications rely on computing dista
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Date Deposited: | 04 Mar 2026 09:16 |
| Last Modified: | 18 Apr 2026 02:39 |
| URI: | http://eprints.eai.eu/id/eprint/4826 |
Actions (login required)
- View Item