Efficient reversal of transductions of sparse graph classes

Jan Dreier, Jakub Gajarský, Michał Pilipczuk

(First-order) transductions are a basic notion capturing graph modifications that can be described in first-order logic. In this work, we propose an efficient algorithmic method to…