English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  A Parallelization of Dijkstra's Shortest Path Algorithm

Crauser, A., Mehlhorn, K., Meyer, U., & Sanders, P. (1998). A Parallelization of Dijkstra's Shortest Path Algorithm. In L. Brim, J. Gruska, & J. Zlatuška (Eds.), Mathematical Foundations of Computer Science 1998 (pp. 722-731). Berlin, Germany: Springer. doi:10.1007/BFb0055823.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-372F-7 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-002B-508F-3
Genre: Conference Paper
Latex : A Parallelization of {D}ijkstra's Shortest Path Algorithm

Files

show Files
hide Files
:
Mehlhorn136.pdf (Publisher version), 673KB
 
File Permalink:
-
Name:
Mehlhorn136.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Crauser, Andreas1, Author           
Mehlhorn, Kurt1, Author           
Meyer, Ulrich1, Author           
Sanders, Peter1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: The single source shortest path (SSSP) problem lacks parallel solutions which are fast and simultaneously work-efficient. We propose simple criteria which divide Dijkstra's sequential SSSP algorithm into a number of phases, such that the operations within a phase can be done in parallel. We give a PRAM algorithm based on these criteria and analyze its performance on random digraphs with random edge weights uniformly distributed in $[0,1]$. We use the ${\cal G}(n,d/n)$ model: the graph consists of $n$~nodes and each edge is chosen with probability $d/n$. Our PRAM algorithm needs ${\cal O}(n^{1/3} \log n)$ time and ${\cal O}(n \log n+dn)$ work with high probability (whp). We also give extensions to external memory computation. Simulations show the applicability of our approach even on non-random graphs.

Details

show
hide
Language(s): eng - English
 Dates: 2008-01-212006-05-281998
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 344426
BibTex Citekey: CMMS1998a
DOI: 10.1007/BFb0055823
 Degree: -

Event

show
hide
Title: 23rd International Symposium on the Mathematical Foundations of Computer Science
Place of Event: Brno, Czech Republic
Start-/End Date: 1998-08-24 - 1998-08-28

Legal Case

show

Project information

show

Source 1

show
hide
Title: Mathematical Foundations of Computer Science 1998
  Abbreviation : MFCS 1998
  Subtitle : 23rd International Symposium, MFCS'98 ; Brno, Czech Republic, August 24-28, 1998 ; Proceedings
Source Genre: Proceedings
 Creator(s):
Brim, Luboš1, Editor
Gruska, Jozef1, Editor
Zlatuška, Jiří, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 722 - 731 Identifier: ISBN: 3-540-64827-5

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 1450 Sequence Number: - Start / End Page: - Identifier: -