Add to ORKGWe provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set problem. To obtain the desired kernel we introduce a method that we call reduce or refine. Our kernelization algorithm analyzes the input graph and either finds an appropriate reduction rule that can be applied, or zooms in on a region of the graph which is more amenable to reduction. We find this method of independent interest and believe that it will be useful to obtain linear kernels for other problems on planar graphs
Abstract In the DOMINATING SET problem we are given an n-vertex graph G with a positive integer k an...
The DOMINATING SET problem is one of the most widely studied problems in graph theory and networking...
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, an...
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and an...
We provide polynomial time data reduction rules for connected dominating set in planar graphs and an...
We provide polynomial time data reduction rules for Connected Dominating Set on planar graphs and an...
We provide polynomial time data reduction rules for connected dominating set on planar graphs and an...
AbstractWe provide polynomial time data reduction rules for Connected Dominating Set on planar graph...
Computationally difficult problems are ubiquitous. Although, sometimes approximations come in handy,...
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data redu...
Abstract. A total dominating set of a graph G = (V,E) is a subset D ⊆ V such that every vertex in V ...
In this thesis we explore the technique of Region Decomposition for finding kernels for Planar Domin...
A total dominating set of a graph $G=(V,E)$ is a subset $D \subseteq V$ suchthat every vertex in $V$...
Abstract. Data reduction by polynomial-time preprocessing is a core concept of (parameterized) compl...
International audienceWe give the first linear kernels for Dominating Set and Connected Dominating S...
Abstract In the DOMINATING SET problem we are given an n-vertex graph G with a positive integer k an...
The DOMINATING SET problem is one of the most widely studied problems in graph theory and networking...
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, an...
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and an...
We provide polynomial time data reduction rules for connected dominating set in planar graphs and an...
We provide polynomial time data reduction rules for Connected Dominating Set on planar graphs and an...
We provide polynomial time data reduction rules for connected dominating set on planar graphs and an...
AbstractWe provide polynomial time data reduction rules for Connected Dominating Set on planar graph...
Computationally difficult problems are ubiquitous. Although, sometimes approximations come in handy,...
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data redu...
Abstract. A total dominating set of a graph G = (V,E) is a subset D ⊆ V such that every vertex in V ...
In this thesis we explore the technique of Region Decomposition for finding kernels for Planar Domin...
A total dominating set of a graph $G=(V,E)$ is a subset $D \subseteq V$ suchthat every vertex in $V$...
Abstract. Data reduction by polynomial-time preprocessing is a core concept of (parameterized) compl...
International audienceWe give the first linear kernels for Dominating Set and Connected Dominating S...
Abstract In the DOMINATING SET problem we are given an n-vertex graph G with a positive integer k an...
The DOMINATING SET problem is one of the most widely studied problems in graph theory and networking...
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, an...