Dominating set is fixed parameter tractable in claw-free graphs
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 4085681 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1324671 (Why is no real title available?)
- scientific article; zbMATH DE number 512804 (Why is no real title available?)
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- scientific article; zbMATH DE number 969067 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Claw-free graphs---a survey
- Claw-free graphs. I: Orientable prismatic graphs
- Claw-free graphs. II: Non-orientable prismatic graphs
- Claw-free graphs. III: Circular interval graphs
- Claw-free graphs. IV: Decomposition theorem
- Claw-free graphs. V. Global structure
- Claw-free graphs. VI: Colouring
- Deciding first-order properties of locally tree-decomposable structures
- Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
- Dominating set is fixed parameter tractable in claw-free graphs
- Domination problems in nowhere-dense classes of graphs
- Fixed-parameter tractability, definability, and model-checking
- Graph minors. XVI: Excluding a non-planar graph
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- On maximal independent sets of vertices in claw-free graphs
- Optimization problems in multiple-interval graphs
- Parametrized complexity theory.
- Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
- Testing first-order properties for subclasses of sparse graphs
- The dominating set problem is fixed parameter tractable for graphs of bounded genus
Cited in
(17)- Twin-width and polynomial kernels
- Parameterized domination in circle graphs
- FPT algorithms for domination in biclique-free graphs
- Improved FPT algorithms for weighted independent set in bull-free graphs
- Triangles, 4-Cycles and Parameterized (In-)Tractability
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
- Modifying a graph using vertex elimination
- Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy
- scientific article; zbMATH DE number 7765378 (Why is no real title available?)
- Computing dense and sparse subgraphs of weakly closed graphs
- Shortest color-spanning intervals
- FPT algorithms for domination in sparse graphs and beyond
- Linear‐time algorithms for eliminating claws in graphs
- Parameterized complexity of induced graph matching on claw-free graphs
- Perfect domination and small cycles
- Dominating set is fixed parameter tractable in claw-free graphs
- Revising Johnson's table for the 21st century
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)
