Treedepth Parameterized by Vertex Cover Number.

DOI10.4230/LIPIcs.IPEC.2016.18zbMath1398.68247OpenAlexW2594217174MaRDI QIDQ4634401

Yasuaki Kobayashi, Hisao Tamaki

Publication date: 10 April 2018

Full work available at URL: https://doi.org/10.4230/LIPIcs.IPEC.2016.18

zbMATH Keywords

vertex coverpolynomial kernelizationfixed-parameter algorithmstructural parameterizationtreedepth

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Maximum Minimal Vertex Cover Parameterized by Vertex Cover ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.

This page was built for publication: Treedepth Parameterized by Vertex Cover Number.