eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2015-11-19
199
211
10.4230/LIPIcs.IPEC.2015.199
article
Linear Kernels for Outbranching Problems in Sparse Digraphs
Bonamy, Marthe
Kowalik, Lukasz
Pilipczuk, Michal
Socala, Arkadiusz
In the k-Leaf Out-Branching and k-Internal Out-Branching problems we are given a directed graph D with a designated root r and a nonnegative integer k. The question is to determine the existence of an outbranching rooted at r that has at least k leaves, or at least k internal vertices, respectively. Both these problems were intensively studied from the points of view of parameterized complexity and kernelization, and in particular for both of them kernels with O(k^2) vertices are known on general graphs. In this work we show that k-Leaf Out-Branching admits a kernel with O(k) vertices on H-minor-free graphs, for any fixed H, whereas k-Internal Out-Branching admits a kernel with O(k) vertices on any graph class of bounded expansion.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol043-ipec2015/LIPIcs.IPEC.2015.199/LIPIcs.IPEC.2015.199.pdf
FPT algorithm
kernelization
outbranching
sparse graphs