Treedepth Parameterized by Vertex Cover Number
نویسندگان
چکیده
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(τ(G)3) vertex kernel and an O(4τ(G)τ(G)n) time fixed-parameter algorithm for this problem, where τ(G) is the size of a minimum vertex cover of G and n is the number of vertices of G. 1998 ACM Subject Classification G.2.2 Graph Algorithms
منابع مشابه
Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems
The q-Coloring problem asks whether the vertices of a graph can be properly colored with q colors. Lokshtanov et al. [SODA 2011] showed that q-Coloring on graphs with a feedback vertex set of size k cannot be solved in time O∗((q− ε)), for any ε > 0, unless the Strong Exponential-Time Hypothesis (SETH) fails. In this paper we perform a fine-grained analysis of the complexity of q-Coloring with ...
متن کاملParameterized complexity of fair deletion problems II
Vertex deletion problems are those where given a graph G and a graph property π, the goal is to find a subset of vertices W such that G \W satisfies property π. Typically, we want to minimize size of the deletion set W . Unlike this, in fair vertex deletion problems we change the objective: we minimize the maximum number of vertices deleted in neighborhood of any vertex. When the property π is ...
متن کاملHow Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?
In the last years, kernelization with structural parameters has been an active area of research within the field of parameterized complexity. As a relevant example, Gajarskỳ et al. [ESA 2013] proved that every graph problem satisfying a property called finite integer index admits a linear kernel on graphs of bounded expansion and an almost linear kernel on nowhere dense graphs, parameterized by...
متن کاملA Faster Parameterized Algorithm for Treedepth
The width measure treedepth, also known as vertex ranking, centered coloring and elimination tree height, is a well-established notion which has recently seen a resurgence of interest. We present an algorithm which—given as input an n-vertex graph, a tree decomposition of the graph of width w, and an integer t—decides Treedepth, i.e. whether the treedepth of the graph is at most t, in time 2O(w...
متن کاملA tight lower bound for Vertex Planarization on graphs of bounded treewidth
In the Vertex Planarization problem one asks to delete the minimum possible number of vertices from an input graph to obtain a planar graph. The parameterized complexity of this problem, parameterized by the solution size (the number of deleted vertices) has recently attracted significant attention. The state-of-the-art algorithm of Jansen, Lokshtanov, and Saurabh [SODA 2014] runs in time 2O(k ...
متن کامل