FO-Query Enumeration over SLP-Compressed Structures of Bounded Degree

Markus Lohrey, Sebastian Maneth, Markus L. Schmid

Enumerating the result set of a first-order query over a relational structure of bounded degree can be done with linear preprocessing and constant delay. In this work, we extend th…