Institute of Theoretical Informatics, Algorithmics II

Engineering an Efficient Reachability Algorithm for Directed Graphs

  • Subject:Reachability
  • Type:Diplomarbeit
  • Date:9. Dezember 2013
  • Supervisor:

    Peter Sanders 

  • Student:

    Florian Merz