A parameterized complexity analysis of bounded height depth-first search trees

Cites work

A faster parameterized algorithm for treedepth
A single-exponential time 2-approximation algorithm for treewidth
Algorithmic Aspects of Vertex Elimination on Graphs
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
Computing tree-depth faster than \(2^n\)
Computing treedepth in polynomial space and linear FPT time
Fundamentals of parameterized complexity
Graph minors. II. Algorithmic aspects of tree-width
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space
scientific article; zbMATH DE number 7650914 (Why is no real title available?)
Kernelization for finding lineal topologies (depth-first spanning trees) with many or few leaves
On finding optimal and near-optimal lineal spanning trees
On Linear Time Minor Tests with Depth-First Search
On space efficiency of algorithms working on structural decompositions of graphs
On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves
Parameterized algorithms
Parameterized complexity of geodetic set
Parameterized complexity of length-bounded cuts and multicuts
Polynomial bounds for centered colorings on proper minor-closed graph classes
Randomly Traceable Graphs
Rankings of Graphs
Space saving by dynamic algebraization based on tree-depth
Sparsity. Graphs, structures, and algorithms
The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
Treedepth Parameterized by Vertex Cover Number.
Vertex rankings of chordal graphs and weighted trees

This page was built for publication: A parameterized complexity analysis of bounded height depth-first search trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294438)