DIMACS Theoretical Computer Science Seminar

Title: Developments in Dynamic graph algorithms

Speaker: Liam Roditty, Tel Aviv University

Date: Wednesday, January 25, 2006 2:00-3:00pm

Location: **Hill Center, Room 482, Rutgers University, Busch Campus, Piscataway, NJ

**Note special location


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.