Treedepth Parameterized by Vertex Cover Number.
From MaRDI portal
Publication:4634401
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
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
- scientific article; zbMATH DE number 7764119 (Why is no real title available?)
- scientific article; zbMATH DE number 7764121 (Why is no real title available?)
- Maximum minimal vertex cover parameterized by vertex cover
- Treewidth and pathwidth parameterized by the vertex cover number
- Computing kernels in parallel: lower and upper bounds
- 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)