In this paper we study the problem of finding a small safe set S in a graph G, i.e. a non-empty set of vertices such that no connected component of G[S] is adjacent to a larger component in. We enhance our understanding of the problem from the viewpoint of parameterized complexity by showing that (1) the problem is W[2]-hard when parameterized by the pathwidth and cannot be solved in time unless the ETH is false, (2) it admits no polynomial kernel parameterized by the vertex cover number unless, but (3) it is fixed-parameter tractable (FPT) when parameterized by the neighborhood diversity, and (4) it can be solved in time for some double exponential function f where is the clique-width. We also present (5) a faster FPT algorithm when parameterized by solution size.
CITATION STYLE
Belmonte, R., Hanaka, T., Katsikarelis, I., Lampis, M., Ono, H., & Otachi, Y. (2019). Parameterized Complexity of Safe Set. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11485 LNCS, pp. 38–49). Springer Verlag. https://doi.org/10.1007/978-3-030-17402-6_4
Mendeley helps you to discover research relevant for your work.