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
 Paper in Conference Proceedings or in Workshop Proceedings
Event Title
 Proceedings of the Parallel Algorithms for Irregularly Structured Problems (IRREGULAR'96)
Divisions
 Scientific Computing
Event Location
 Santa Barbara, CA, USA
Event Type
 Conference
Event Dates
 NULL
Publisher
 Springer
Page Range
 183--194
Date
 1996
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.