1 citations · 1 across the 1 of their papers we have counts for
4 papers
CMSO-transducing tree-like graph decompositions
Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté +2
We give -transductions that, given a graph , output its modular decomposition, its split decomposition and its bi-join decomposition. This improves results…
Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
Bogdan Alecu, Mamadou Moustapha Kanté, Vadim Lozin +1
Lettericity is a graph parameter responsible for many attractive structural properties. In particular, graphs of bounded lettericity have bounded linear clique-width and they are w…
Computing pivot-minors
Konrad K. Dabrowski, François Dross, Jisu Jeong +4
A graph contains a graph as a pivot-minor if can be obtained from by applying a sequence of vertex deletions and edge pivots. Pivot-minors play an important role in…
Counting Minimal Transversals of -Acyclic Hypergraphs
Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
We prove that one can count in polynomial time the number of minimal transversals of -acyclic hypergraphs. In consequence, we can count in polynomial time the number of minimal…