Transducing Linear Decompositions of Tournaments
By: Colin Geniet, Fatemeh Ghasemi, Mamadou Moustapha Kanté
Potential Business Impact:
Makes computers understand special graphs faster.
Bojańczyk, Pilipczuk, and Grohe [LICS '18] proved that for graphs of bounded linear clique-width, clique-decompositions of bounded width can be produced by a CMSO transduction. We show that in the case of tournaments, a first-order transduction suffices. This implies that the logics CMSO and existential MSO are equivalent over bounded linear clique-width tournaments.
Similar Papers
Graphs of unbounded linear cliquewidth must transduce all trees
Logic in Computer Science
Makes computers build any tree-like structure.
On Algorithmic Meta-Theorems for Solution Discovery: Tractability and Barriers
Data Structures and Algorithms
Finds solutions by moving pieces on a board.
The role of counting quantifiers in laminar set systems
Logic in Computer Science
Turns complex group rules into simple tree maps.