Dominating set is fixed parameter tractable in claw-free graphs

  title={Dominating set is fixed parameter tractable in claw-free graphs},
  author={Marek Cygan and Geevarghese Philip and Marcin Pilipczuk and Michal Pilipczuk and Jakub Onufry Wojtaszczyk},
  journal={Theor. Comput. Sci.},

Figures from this paper

Domination When the Stars Are Out

It is shown that Dominating Set on claw-free graphs is (i) fixed-parameter tractable and (ii) even possesses a polynomial kernel.

Linear-time Algorithms for Eliminating Claws in Graphs

It is shown that the problem of determining the distance of a given graph to a claw-free graph can be solved in linear time by a simpler algorithm on forests, and the exact values for full $k$-ary trees are determined.

Parameterized Domination in Circle Graphs

It turns out that Connected Acyclic Dominating Set is polynomial-time solvable in circle graphs, and the FPT algorithm runs in subexponential time.

Connected $k$-partition of $k$-connected graphs and $c$-claw-free graphs

This work shows how to efficiently compute connected partitions that at least approximately meet the target weights, subject to the mild assumption that each wi is greater than the weight of the heaviest vertex.

Online Domination: The Value of Getting to Know All your Neighbors

The results quantify the value of knowing the entire neighborhood at the time a vertex is revealed as compared to the restricted neighborhood, whereas knowing the neighbors allows us to improve it to 2-competitiveness.

Improved FPT algorithms for weighted independent set in bull-free graphs

Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT

It is proved that there is no polynomial-time algorithm that reduces any n-vertex input to an equivalent instance, of an arbitrary problem, with bitsize, and a non-trivial sparsification algorithm is exhibited for d-Not-All-Equal-SAT.

How to Eliminate a Graph

The parameterized complexity of the Elimination problem is studied and it is shown that Elimination is W[1]-hard when parameterized by |V(H)|, even if both input graphs are split graphs, and W[2]- hard when parameterize by |G(G)|−|V( H)|,even if H is a complete graph.

Modifying a Graph Using Vertex Elimination

The computational complexity of the problem depends on which graph is assumed to be a tree: it is shown that Elimination can be solved in polynomial time when H is a tree, whereas it remains NP-complete when G is a Tree.

Domination When the Stars Are Out

It is shown that Dominating Set on claw-free graphs is (i) fixed-parameter tractable and (ii) even possesses a polynomial kernel.

Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs

This paper gives a kO(dk)n time algorithm for finding a dominating set of size at most k in a d-degenerated graph with n vertices, which proves that the dominating set problem is fixed-parameter tractable for degenerated graphs.

On maximal independent sets of vertices in claw-free graphs

  • G. Minty
  • Mathematics
    J. Comb. Theory, Ser. B
  • 1980

Domination Problems in Nowhere-Dense Classes

It is shown that the distance-$d$ dominating-set problem, also known as the $(k,d)$-centres problem, is fixed-parameter tractable on any class that is nowhere dense and closed under induced subgraphs.

Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels

We show that the k -Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of graphs that exclude K i,j as a subgraph, for any fixed i,j ≥ 1. This

Deciding First-Order Properties for Sparse Graphs

An almost linear-time algorithm for deciding first-order logic (FOL) properties in classes of graphs with bounded expansion and a dynamic data structure for graphs belonging to a fixed class of graphs of bounded expansion for testing existential properties or the existence of short paths between prescribed vertices.

Fixed Parameter Tractability and Completeness

It is shown that if Dominating Set is fixed-parameter tractable, then so are a variety of parameterized problems, such as Independent Set, and that for this problem, and for the problem of determining whether a graph has k disjoint cycles, it may take c = 1.

Optimization problems in multiple-interval graphs

It is proved that MAXIMUM CLIQUE is NP-complete for the case of t = 3, and a (t2--t+1)/2-approximation algorithm for the problem is provided, using recent bounds proven for the so-called transversal number of t-interval families.

Claw-free graphs VI. Colouring