de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Δ-stepping: a parallelizable shortest path algorithm

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45038

Meyer,  Ulrich
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45344

Sanders,  Peter
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

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


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-2E91-7
Abstract
There is no abstract available