Heaps are better than Buckets: Parallel Shortest Paths on Unbalanced Graphs

Meyer, Ulrich

Local TagsRelease HistoryDetailsSummary

Heaps are better than Buckets: Parallel Shortest Paths on Unbalanced Graphs

Meyer, U. (2001). Heaps are better than Buckets: Parallel Shortest Paths on Unbalanced Graphs. In R. Sakellariou, J. Keane, J. Gurd, & L. Freeman (Eds.), Proceedings of the 7th International Euro-Par Conference on Parallel Processing (Euro-Par-01): (pp. 343-351). Berlin, Germany: Springer.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3192-4 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3194-F

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
Meyer, Ulrich¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

hide

Free keywords: -

Abstract: We propose a new parallel algorithm for the single-source shortest-path problem (SSSP). Its heap data structure is particularly advantageous on graphs with a moderate number of high degree nodes. On arbitrary directed graphs with $n$ nodes, $m$ edges and independent random edge weights uniformly distributed in the range $[0,1]$ and maximum shortest path weight $\Diam$ the PRAM version of our algorithm runs in ${\cal O}(\log^2 n \cdot \min_{i} \{2^i \cdot \Diam \cdot \log n+ |V_i| \})$ average-case time using ${\cal O}(n \cdot \log n +m )$ operations where $|V_i|$ is the number of graph vertices with degree at least $2^i$. For power-law graph models of the Internet or call graphs this results in the first work-efficient $o(n^{1/4})$ average-case time algorithm.

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-02Date issued: 2001

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 518171
URI: http://link.springer.de/link/service/series/0558/papers/2150/21500343.pdf
Other: Local-ID: C1256428004B93B8-83D946724E1284E1C1256A69004811A7-Meyer2001c

Degree: -

Event

show

hide

Title: Untitled Event

Place of Event: Manchester, UK

Start-/End Date: 2001

Legal Case

show

Project information

show

Source 1

show

hide

Title: Proceedings of the 7th International Euro-Par Conference on Parallel Processing (Euro-Par-01) :

Source Genre: Proceedings

Creator(s):
Sakellariou, Rizos, Editor
Keane, John, Editor
Gurd, John, Editor
Freeman, Len, Editor

Affiliations:
-

Publ. Info: Berlin, Germany : Springer

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 343 - 351 Identifier: ISBN: 3-540-42495-4

Source 2

show

hide

Title: Lecture Notes in Computer Science

Source Genre: Series

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 2150 Sequence Number: - Start / End Page: - Identifier: -