Treedepth Parameterized by Vertex Cover Number.
DOI10.4230/LIPICS.IPEC.2016.18zbMATH Open1398.68247OpenAlexW2594217174MaRDI QIDQ4634401FDOQ4634401
Authors: Yasuaki Kobayashi, Hisao Tamaki 
Publication date: 10 April 2018
Full work available at URL: https://doi.org/10.4230/LIPIcs.IPEC.2016.18
Recommendations
- Treewidth and Pathwidth Parameterized by the Vertex Cover Number
- Treewidth and pathwidth parameterized by the vertex cover number
- Tree-depth and vertex-minors
- On the tree cover number of a graph
- scientific article; zbMATH DE number 5775505
- A faster parameterized algorithm for treedepth
- Vertex cover and edge-vertex domination in trees
- Branch-depth: generalizing tree-depth of graphs
- Exploring the gap between treedepth and vertex cover through vertex integrity
- Exploring the gap between treedepth and vertex cover through vertex integrity
Graph algorithms (graph-theoretic aspects) (05C85) 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)
Cited In (10)
- Treewidth and Pathwidth Parameterized by the Vertex Cover Number
- A graph searching game for block treedepth and a cubic kernel by vertex cover
- A faster parameterized algorithm for treedepth
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximum minimal vertex cover parameterized by vertex cover
- Computing kernels in parallel: lower and upper bounds
- Treewidth and pathwidth parameterized by the vertex cover number
- The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.
- Exploring the gap between treedepth and vertex cover through vertex integrity
This page was built for publication: Treedepth Parameterized by Vertex Cover Number.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4634401)
