Engineering an Efficient Reachability Algorithm for Directed Graphs

  • Forschungsthema:Reachability
  • Typ:Diplomarbeit
  • Datum:2013-12-09
  • Betreuer:

    Peter Sanders 

  • Bearbeiter:

    Florian Merz