Treedepth Parameterized by Vertex Cover Number
Yasuaki Kobayashi, Hisao Tamaki · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2017
To solve hard graph problems from the parameterized perspective, structural parameters have commonly been used. In particular, vertex cover number is frequently used in this context. In this paper, we study the problem of computing the treedepth of a given graph G. We show that there are an O(tau(G)^3) vertex kernel and an O(4^{tau(G)}*tau(G)*n) time fixed-parameter algorithm for this problem, where tau(G) is the size of a minimum vertex cover of G and n is the number of vertices of G.