[PDF][PDF] The PACE 2020 parameterized algorithms and computational experiments challenge: Treedepth
Abstract This year's Parameterized Algorithms and Computational Experiments challenge
(PACE 2020) was devoted to the problem of computing the treedepth of a given graph …
(PACE 2020) was devoted to the problem of computing the treedepth of a given graph …
Partitioning algorithms for induced subgraph problems
J Trimble - 2023 - theses.gla.ac.uk
This dissertation introduces the MCSPLIT family of algorithms for two closely-related NP-
hard problems that involve finding a large induced subgraph contained by each of two input …
hard problems that involve finding a large induced subgraph contained by each of two input …
Recent advances in positive-instance driven graph searching
Research on the similarity of a graph to being a tree—called the treewidth of the graph—has
seen an enormous rise within the last decade, but a practically fast algorithm for this task has …
seen an enormous rise within the last decade, but a practically fast algorithm for this task has …
On the size of minimal separators for treedepth decomposition
Z Xu, V Suppakitpaisarn - Discrete Applied Mathematics, 2024 - Elsevier
The treedepth of a graph is a parameter that describes how it is close to a star graph.
Recently, many parameterized algorithms have been developed for solving various …
Recently, many parameterized algorithms have been developed for solving various …