A general kernelization technique for domination and independence problems in sparse classes
share
We unify and extend previous kernelization techniques in sparse classes [5, 16] by defining a structure we call water lilies and show how it can be used in bounded expansion classes to construct linear bikernels for (r, c)-DOMINATING SET, (r, c)-SCATTERED SET, TOTAL r-DOMINATION, r-Roman Domination, and a problem we call (r, [λ, μ])-DOMINATION (implying a bikernel for r-PERFECT CODE). At the cost of slightly changing the output graph class these bikernels can be turned into into kernels. Finally, we demonstrate how these constructions can be combined to create 'multikernels', meaning graphs who represent kernels for multiple problems at once. Concretely, we show that r-DOMINATING SET, TOTAL r-DOMINATION, and r-ROMAN DOMINATION admit a multikernel; as well as r-DOMINATING SET and 2r-INDEPENDENT SET for multiple values of r at once.
READ FULL TEXT
