1 Hit in 3.7 sec

Transducing paths in graph classes with unbounded shrubdepth [article]

Michał Pilipczuk, Patrice Ossona de Mendez, Sebastian Siebertz
2022 arXiv   pre-print
Transductions are a general formalism for expressing transformations of graphs (and more generally, of relational structures) in logic.  ...  This establishes one of the three remaining open questions posed by Blumensath and Courcelle about the 𝖬𝖲𝖮-transduction quasi-order, even in the stronger form that concerns 𝖥𝖮-transductions instead  ...  The research leading to the results presented in this work was initiated during Dagstuhl Seminar 21391 Sparsity in Algorithms, Combinatorics, and Logic.  ... 
arXiv:2203.16900v1 fatcat:yxevmfwwt5dxxgdwhypuwwktlq