English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs

MPS-Authors
/persons/resource/persons45632

Träff,  Jesper Larsson
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45787

Zaroliagis,  Christos
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Träff, J. L., & Zaroliagis, C. (1996). A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs. In A. Ferreira, J. Rolim, Y. Saad, & T. Yang (Eds.), Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96) (pp. 183-194). Berlin: Springer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-AB57-9
Abstract
There is no abstract available