First-order queries on structures of bounded degree are computable with constant delay

Arnaud Durand (1) , Etienne Grandjean (2)

1 ELM - Équipe de Logique Mathématique
2 Equipe AMACC - Laboratoire GREYC - UMR6072

This paper proves that any fixed first-order query over any structure of bounded degree can be computed with a constant delay between the tuples of the solution after a precomputation of linear time in the size of the structure S.

Domaines: Complexité [cs.CC]

Arnaud Durand, Etienne Grandjean. First-order queries on structures of bounded degree are computable with constant delay. ACM Transactions on Computational Logic, 2007, 8 (4), pp.1-18. ⟨hal-00195016⟩