2012
DOI: 10.1145/2390176.2390187
|View full text |Cite
|
Sign up to set email alerts
|

Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond

Abstract: We show that for any fixed j ≥ i ≥ 1, the k-DOMINATING SET problem restricted to graphs that do not have K i, j (the complete bipartite graph on (i + j) vertices, where the two parts have i and j vertices, respectively) as a subgraph is fixed parameter tractable (FPT) and has a polynomial kernel. We describe a polynomial-time algorithm that, given a K i, j -free graph G and a nonnegative integer k, constructs a graph H (the "kernel") and an integer k ′ such that (1) G has a dominating set of size at most k if … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

1
41
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 73 publications
(42 citation statements)
references
References 32 publications
1
41
0
Order By: Relevance
“…Our algorithm to find a k-domination core heavily relies on several earlier results. We combine several of the ideas introduced in [2,10,14,40,41,46] and, as a byproduct, are able to simplify the proofs of some of the results. Note that V (G) is a k-domination core.…”
Section: A General Frameworkmentioning
confidence: 99%
See 2 more Smart Citations
“…Our algorithm to find a k-domination core heavily relies on several earlier results. We combine several of the ideas introduced in [2,10,14,40,41,46] and, as a byproduct, are able to simplify the proofs of some of the results. Note that V (G) is a k-domination core.…”
Section: A General Frameworkmentioning
confidence: 99%
“…For this reason, the (Connected) Dominating Set problem and (Connected) Distance-r Dominating Set problem have been extensively studied on restricted graph classes. A particularly fruitful line of research in this area concerns kernelization algorithms for the aforementioned problems [1,4,17,18,19,41].…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…A polynomial kernel for p-F-Deletion for class F consisting of a graph with two vertices and several parallel edges is given in [47]. Philip et al [68] and Cygan et al [31] obtained polynomial kernels for Pathwidth 1-Deletion. Our next theorem generalizes all these kernelization results.…”
mentioning
confidence: 99%
“…Thus, we wonder whether there exist deterministic algorithms forPseudoforest Deletion that run in O(c k n) time for constant c depending on . Philip et al [13] show that for every , -Pseudoforest Deletion has a kernel with O(k 2 ) vertices. Given the local nature of Pseudoforest Deletion, it is interesting to see if there exists a kernel for it with a linear number of vertices.…”
Section: Discussionmentioning
confidence: 99%