no code implementations • 15 May 2020 • Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu
We present the first 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.
Data Structures and Algorithms
