scientific article; zbMATH DE number 7764119

DOI10.4230/lipics.ipec.2020.28MaRDI QIDQ6089676

Martin Schuster, Max Bannach, Sebastian Berndt, Unnamed Author

Publication date: 13 November 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

treedepthpositive-instance driven

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.

Cites Work

• LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth
• Positive-instance driven dynamic programming for graph searching
• Positive-instance driven dynamic programming for treewidth
• Treedepth Parameterized by Vertex Cover Number.
• SAT-Encodings for Treecut Width and Treedepth

This page was built for publication: