Home | english  | Impressum | Sitemap | KIT

Using Graph Partitioning to Accelerate Longest Path Search

Using Graph Partitioning to Accelerate Longest Path Search
Forschungsthema:Longest Paths
Typ:Bachelorarbeit
Datum:7.11.2016
Betreuer:

Tomas Balyo, Peter Sanders

Bearbeiter:

Kai Fieger

Links:PDF