Information

Abstract

Finding shortest paths is a problem that comes up in many applications: Google maps, network routing, motion planning, connectivity in social networks, and etc. The domain may be a graph, either explicitly or implicitly represented, or a geometric space.

Professor Lubiw will survey the field, from Dijkstra's foundational algorithm to current results and open problems. There will be lots of pictures and lots of ideas.

Click here to see the slides from the talk.

Click here for the recorded talk.