1 research outputs found
A Linear Kernel for Planar Red-Blue Dominating Set
In the Red-Blue Dominating Set problem, we are given a bipartite graph and an integer , and asked whether has a subset of at most "blue" vertices such that each "red" vertex from
is adjacent to a vertex in . We provide the first explicit linear
kernel for this problem on planar graphs, of size at most .Comment: 20 pages, 5 figure