English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Δ-stepping: a parallelizable shortest path algorithm

Meyer, U., & Sanders, P. (2003). Δ-stepping: a parallelizable shortest path algorithm. Journal of Algorithms, 49, 114-152.

Item is

Files

show Files

Locators

show

Creators

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

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2004-06-152003
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 202034
Other: Local-ID: C1256428004B93B8-AC85C4C86B19B506C1256E1500325F12-Meyer2003a
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Journal of Algorithms
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 49 Sequence Number: - Start / End Page: 114 - 152 Identifier: ISSN: 0196-6774