Home | deutsch  | Legals | Sitemap | KIT

Engineering an Efficient Reachability Algorithm for Directed Graphs

Engineering an Efficient Reachability Algorithm for Directed Graphs
Subject:Reachability
Type:Diplomarbeit
Date:9. Dezember 2013
Supervisor:

Peter Sanders 

Student:

Florian Merz 

Links:PDF