Computing the th solution of a first-order query
We design algorithms of “optimal" for several natural problems about first-order queries on structures of bounded degree. For that purpose, we first introduce a framework to deal with logical or combinatorial problems whose instances may admit of several solutions . One associates to such a problem several specific tasks: compute a (for the uniform probability distribution) solution ; without repetition each solution in some specific linear order where ; compute the solution...