Developments in Dynamic Graph Algorithms
In this talk I will survey the latest development in dynamic algorithms for fundamental graph problems, such as shortest paths, reachability and connectivity. In the last five years there were many STOC/FOCS/SODA publications on dynamic graphs. I will overview the most important results in the area and will focus on two results regarding shortest paths which are part of my PhD thesis.
Speaker Details
PhD student under the supervision of Prof. Uri Zwick. My primary interest is in designing efficient algorithms.
- Date:
- Speakers:
- Liam Roditty
- Affiliation:
- Tel Aviv University
-
-
Jeff Running
-
