A simple parallel algorithm for the single-source shortest path problem on 
planar digraphs

Träff, Jesper Larsson; Zaroliagis, Christos

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

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 Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

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. (2000). A simple parallel algorithm for the single-source shortest path problem on planar digraphs. Journal of Parallel and Distributed Computing, 60(9), 1103-1124.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3387-C

Abstract

There is no abstract available