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

07/12/2017

∙

by   Benjamin Bergougnoux, et al.

∙

0

∙

share

Given a clique-width expression of a graph G of clique-width k, we provide 2 O(k) × n O(1) time algorithms for connectivity constraints on locally checkable properties such as Connected Dominating Set, Connected Perfect Dominating Set or Node-Weighted Steiner Tree. We also propose an 2 O(k) × n O(1) time algorithm for Feedback Vertex Set. The best running times for all the considered cases were either 2 O(k×log(k)) × n O(1) .