Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Institute: MPI für Informatik     Collection: Algorithms and Complexity Group     Display Documents



ID: 518168.0, MPI für Informatik / Algorithms and Complexity Group
A simple parallel algorithm for the single-source shortest path problem on planar digraphs
Authors:Träff, Jesper Larsson; Zaroliagis, Christos
Language:English
Date of Publication (YYYY-MM-DD):2000
Title of Journal:Journal of Parallel and Distributed Computing
Volume:60
Issue / Number:9
Start Page:1103
End Page:1124
Review Status:Peer-review
Audience:Experts Only
Intended Educational Use:No
Last Change of the Resource (YYYY-MM-DD):2010-03-02
External Publication Status:published
Document Type:Article
Communicated by:Kurt Mehlhorn
Affiliations:MPI für Informatik/Algorithms and Complexity Group
Identifiers:LOCALID:C1256428004B93B8-9AFD9FF59A7D8E77C1256A15004F6FC1-...
ISSN:0743-7315
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.