Fast exact algorithms for some connectivity problems parametrized by clique-width

Benjamin Bergougnoux, Mamadou Moustapha Kanté

Given a clique-width $k$-expression of a graph $G$, we provide $2^{O(k)}\cdot n$ time algorithms for connectivity constraints on locally checkable properties such as Node-Weighted…