Please note: This master’s thesis presentation will take place online.
Newsha Seyedi, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Ian Munro
This thesis delves into the exploration of shortest path queries in planar graphs, with an emphasis on the utilization of space-efficient data structures. Our investigation primarily targets connected, undirected, static pointer planar graphs, focusing on scenarios where queries predominantly start or end at a select subset of nodes.