2026-07-23T22:07:03Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:11138 2024-03-06T10:47:32Z ddc:004 open_access

More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints Bergougnoux, Benjamin Kanté, Mamadou Moustapha connectivity problem feedback vertex set d-neighbor equivalence {sigma,rho}-domination clique-width rank-width mim-width 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)* n^O(1), 2^O(k log(k))* n^O(1), 2^O(k^2) * n^O(1) and n^O(k) time algorithms parameterized respectively by clique-width, 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 [Bui-Xuan, Telle and Vatshelle, TCS 2013]. 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, Q-rank-width and rank-width. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Benjamin Bergougnoux and Mamadou Moustapha Kanté 2019 Is Part Of LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ESA.2019.17 urn:nbn:de:0030-drops-111383 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.17 eng https://creativecommons.org/licenses/by/3.0/legalcode