Computing treedepth in polynomial space and linear FPT time
From MaRDI portal
Cites work
- A c^k n 5-approximation algorithm for treewidth
- A distributed low tree-depth decomposition algorithm for bounded expansion classes
- A faster parameterized algorithm for treedepth
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A single-exponential time 2-approximation algorithm for treewidth
- First-order interpretations of bounded expansion classes
- Forbidden graphs for tree-depth
- Grad and classes with bounded expansion. II: Algorithmic aspects
- Hamiltonian cycle parameterized by treedepth in single exponential time and polynomial space
- scientific article; zbMATH DE number 7650914 (Why is no real title available?)
- scientific article; zbMATH DE number 7788388 (Why is no real title available?)
- Improved bounds for the excluded-minor approximation of treedepth
- Methods for algorithmic meta theorems
- On low tree-depth decompositions
- On space efficiency of algorithms working on structural decompositions of graphs
- Parameterized circuit complexity of model-checking on sparse structures
- Polynomial bounds for centered colorings on proper minor-closed graph classes
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Space saving by dynamic algebraization
- Sparsity. Graphs, structures, and algorithms
- The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.
Cited in
(4)
This page was built for publication: Computing treedepth in polynomial space and linear FPT time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969599)
