A graph searching game for block treedepth and a cubic kernel by vertex cover
From MaRDI portal
Publication:6590085
DOI10.1016/J.TCS.2024.114718MaRDI QIDQ6590085
Filippos Mavropoulos, Archontia C. Giannopoulou
Publication date: 21 August 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph isomorphism parameterized by elimination distance to bounded degree
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth
- An annotated bibliography on guaranteed graph searching
- A partial k-arboretum of graphs with bounded treewidth
- Grad and classes with bounded expansion. I: Decompositions
- Digraph width measures in parameterized algorithmics
- Tree-depth, subgraph coloring and homomorphism bounds
- Rankings of Graphs
- Treedepth Parameterized by Vertex Cover Number.
- Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
- Parameterized Algorithms
- Block elimination distance
This page was built for publication: A graph searching game for block treedepth and a cubic kernel by vertex cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6590085)
