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

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

Content
Grafik
Authors
  • Träff, Jesper Larsson
Grafik Top
Shortfacts
Category
 Journal Paper
Divisions
 Scientific Computing
Journal or Publication Title
 Journal of Parallel and Distributed Computing
Page Range
 1103--1124
Number
 9
Volume
 60
Date
 2000
Export
Grafik Top
Universität Wien| Fakultät für Informatik | Währinger Straße 29 | 1090 Wien | T +43-1-4277-780 01 | Imprint | Webteam
EPrints Logo
CS is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.