PhD Seminar • Algorithms and Complexity • Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees
Please note: This PhD seminar will take place in DC 1304 and virtually over Zoom.
Kaiyu (Kevin) Wu, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor J. Ian Munro
We present succinct distance oracles for (unweighted) interval graphs and related classes of graphs, using a novel succinct data structure for ordinal trees that supports the mapping between preorder (i.e., depth-first) ranks and level-order (breadth-first) ranks of nodes in constant time.