Summary: In this paper, we design a framework to obtain efficient algorithms for several problems with a global constraint (acyclicity or connectivity) such as Connected Dominating Set, Node Weighted Steiner Tree, Maximum Induced Tree, Longest Induced Path, and Feedback Vertex Set. For all these problems, we obtain \(2^{O(k)}\cdot n^{O(1)}\), \(2^{O(k\log(k))}\cdot n^{O(1)}\), \(2^{O(k^2)}\cdot n^{O(1)}\) and \(n^{O(k)}\) time algorithms parameterized respectively by clique-width, \(\mathbb{Q}\)-rank-width, rank-width and maximum induced matching width. Our approach simplifies and unifies the known algorithms for each of the parameters and match asymptotically also the running time of the best algorithms for basic NP-hard problems such as Vertex Cover and Dominating Set. Our framework is based on the \(d\)-neighbor equivalence defined in [B.-M. Bui-Xuan et al., Theor. Comput. Sci. 511, 66–76 (2013; Zbl 1408.68111)]. The results we obtain highlight the importance and the generalizing power of this equivalence relation on width measures. We also prove that this equivalence relation could be useful for Max Cut: a W[1]-hard problem parameterized by clique-width. For this latter problem, we obtain \(n^{O(k)}\), \(n^{O(k)}\) and \(n^{2^{O(k)}}\) time algorithm parameterized by clique-width, \(\mathbb{Q}\)-rank-width and rank-width.
For the entire collection see [Zbl 1423.68016].