17 citations · 42 across the 15 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2021
Generalisations of Matrix Partitions : Complexity and Obstructions
Alexey Barsukov, Mamadou Moustapha Kanté
A trigraph is a graph where each pair of vertices is labelled either 0 (a non-arc), 1 (an arc) or (both an arc and a non-arc). In a series of papers, Hell and co-authors pr…
cs.CC2017★ 2 cited
Fast exact algorithms for some connectivity problems parametrized by clique-width
Benjamin Bergougnoux, Mamadou Moustapha Kanté
Given a clique-width -expression of a graph , we provide time algorithms for connectivity constraints on locally checkable properties such as Node-Weighted…