Home | deutsch  | Legals | Sitemap | KIT

Parallel Pruned Landmark Labeling for Shortest Path Queries on Unit-Weight Networks

Parallel Pruned Landmark Labeling for Shortest Path Queries on Unit-Weight Networks
Type:Bachelorarbeit
Date:25.02.2015
Supervisor:

Peter Sanders

Student:

Damir Ferizovic

Links:Links_bearbeiten