Dominating set is fixed parameter tractable in claw-free graphs

DOI10.1016/J.TCS.2011.09.010zbMATH Open1228.68030arXiv1011.6239OpenAlexW2005475011MaRDI QIDQ650938FDOQ650938

Authors: Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk 

Publication date: 7 December 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Abstract: We show that the dominating set problem parameterized by solution size is fixed-parameter tractable (FPT) in graphs that do not contain the claw (K(1,3)), the complete bipartite graph on four vertices where the two parts have one and three vertices, respectively) as an induced subgraph. We present an algorithm that uses 2^O(k^2)n^O(1) time and polynomial space to decide whether a claw-free graph on n vertices has a dominating set of size at most k. Note that this parameterization of dominating set is W[2]-hard on the set of all graphs, and thus is unlikely to have an FPT algorithm for graphs in general. The most general class of graphs for which an FPT algorithm was previously known for this parameterization of dominating set is the class of K(i,j)-free graphs, which exclude, for some fixed i,j, the complete bipartite graph K(i,j) as a subgraph. For i,i >= 2, the class of claw-free graphs and any class of K(i,j)-free graphs are not comparable with respect to set inclusion. We thus extend the range of graphs over which this parameterization of dominating set is known to be fixed-parameter tractable. We also show that, in some sense, it is the presence of the claw that makes this parameterization of the dominating set problem hard. More precisely, we show that for any t ?>= 4, the dominating set problem parameterized by the solution size is W[2]-hard in graphs that exclude the t-claw K(1,t) as an induced subgraph. Our arguments also imply that the related connected dominating set and dominating clique problems are W[2]-hard in these graph classes. Finally, we show that for any t, the clique problem parameterized by solution size, which is W[1]-hard on general graphs, is FPT in t-claw-free graphs. Our results add to the small and growing collection of FPT results for graph classes defined by excluded subgraphs, rather than by excluded minors.

Full work available at URL: https://arxiv.org/abs/1011.6239

Recommendations

• Domination when the stars are out
• Domination when the stars are out
• FPT algorithms for domination in biclique-free graphs
• Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
• FPT algorithms for domination in sparse graphs and beyond

zbMATH Keywords

dominating setcliqueclaw-free graphsfixed parameter tractabilityconnected dominating set

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• Claw-free graphs---a survey
• Parametrized complexity theory.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Claw-free graphs. V. Global structure
• Title not available (Why is that?)
• On maximal independent sets of vertices in claw-free graphs
• Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
• Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Deciding first-order properties of locally tree-decomposable structures
• Title not available (Why is that?)
• Title not available (Why is that?)
• Domination problems in nowhere-dense classes of graphs
• Graph minors. XVI: Excluding a non-planar graph
• Claw-free graphs. IV: Decomposition theorem
• Optimization problems in multiple-interval graphs
• Claw-free graphs. III: Circular interval graphs
• Title not available (Why is that?)
• Claw-free graphs. VI: Colouring
• Domination when the stars are out
• Claw-free graphs. I: Orientable prismatic graphs
• Claw-free graphs. II: Non-orientable prismatic graphs
• Dominating set is fixed parameter tractable in claw-free graphs
• Fixed-parameter tractability, definability, and model-checking
• The dominating set problem is fixed parameter tractable for graphs of bounded genus
• Testing first-order properties for subclasses of sparse graphs

Cited In (17)

• Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy
• Parameterized domination in circle graphs
• Title not available (Why is that?)
• Perfect domination and small cycles
• Improved FPT algorithms for weighted independent set in bull-free graphs
• FPT algorithms for domination in biclique-free graphs
• Modifying a graph using vertex elimination
• Shortest color-spanning intervals
• Triangles, 4-Cycles and Parameterized (In-)Tractability
• Computing dense and sparse subgraphs of weakly closed graphs
• Linear‐time algorithms for eliminating claws in graphs
• Parameterized complexity of induced graph matching on claw-free graphs
• Dominating set is fixed parameter tractable in claw-free graphs
• Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
• Domination when the stars are out
• Revising Johnson's table for the 21st century
• Twin-width and polynomial kernels

This page was built for publication: Dominating set is fixed parameter tractable in claw-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650938)