Bonamy, Marthe

Kowalik, Lukasz

Pilipczuk, Michał

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

Pilipczuk, Michal

Dagstuhl Research Online Publication Server

Linear Kernels for Outbranching Problems in Sparse Digraphs

Archive Ouverte en Sciences de l'Information et de la Communication

HAL Descartes

Hal-Diderot

http://drops.dagstuhl.de/opus/volltexte/2015/5583/pdf/20.pdf

Linear Kernels for Outbranching Problems in Sparse Digraphs

Abstract

Similar works

Full text

Available Versions

Dagstuhl Research Online Publication Server

Archive Ouverte en Sciences de l'Information et de la Communication

HAL Descartes

Hal-Diderot