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

Träff, Jesper Larsson; Zaroliagis, Christos

Local TagsRelease HistoryDetailsSummary

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

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3387-C Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3388-A

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Träff, Jesper Larsson¹, Author
Zaroliagis, Christos¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-02Date issued: 2000

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 518168
Other: Local-ID: C1256428004B93B8-9AFD9FF59A7D8E77C1256A15004F6FC1-TraeffZaroliagis2000

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Journal of Parallel and Distributed Computing

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 60 (9) Sequence Number: - Start / End Page: 1103 - 1124 Identifier: ISSN: 0743-7315