Compact Navigation and Distance Oracles for Graphs with Small Treewidth

Arash Farzan, Shahin Kamali

Abstract: Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to build space-efficient encodings (oracles) to perform various queries efficiently. We assume the word RAM model where the size of a word is Ω(logn) bits.