Conference paper (in proceedings)

Locally Checkable Problems Parameterized by Clique-Width

BP2-STS

Show more…
  • 14.12.2022
Published in:
  • 33rd International Symposium on Algorithms and Computation (ISAAC 2022). - Schloss Dagstuhl - Leibniz-Zentrum für Informatik. - 2022, p. 31:1-31:20
English We continue the study initiated by Bonomo-Braberman and Gonzalez in 2020 on r-locally checkable problems. We propose a dynamic programming algorithm that takes as input a graph with an associated clique-width expression and solves a 1-locally checkable problem under certain restrictions. We show that it runs in polynomial time in graphs of bounded clique-width, when the number of colors of the locally checkable problem is fixed. Furthermore, we present a first extension of our framework to global properties by taking into account the sizes of the color classes, and consequently enlarge the set of problems solvable in polynomial time with our approach in graphs of bounded clique-width. As examples, we apply this setting to show that, when parameterized by clique-width, the [k]−Roman domination problem is FPT, and the k-community problem, Max PDS and other variants are XP.
Faculty
Faculté des sciences économiques et sociales et du management
Department
Département d'informatique
Language
  • English
Classification
Computer science and technology
License
CC BY
Open access status
green
Identifiers
Persistent URL
https://folia.unifr.ch/unifr/documents/323674
Statistics

Document views: 31 File downloads:
  • lipics-isaac-2022-31.pdf: 16