Results 111 to 120 of about 364 (127)
Some of the next articles are maybe not open access.
Efficient Interprocedural Data-Flow Analysis Using Treedepth and Treewidth
International Conference on Verification, Model Checking and Abstract Interpretation, 2023A. Goharshady, Ahmed Khaled Zaher
semanticscholar +2 more sources
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth
15th International Symposium on Parameterized and Exact Computation, IPEC 2020, 2020 This year’s Parameterized Algorithms and Computational Experiments challenge (PACE 2020) was devoted to the problem of computing the treedepth of a given graph. Altogether 51 participants from 20 teams, 12 countries and 3 continents submitted their implementations to the competition. In this report, we describe the setup of the challenge, the selection
Lukasz Kowalik +5 more
semanticscholar +6 more sources
A Faster Parameterized Algorithm for Treedepth [PDF]
Lecture Notes in Computer Science, 2014 The width measure \emph{treedepth}, also known as vertex ranking, centered coloring and elimination tree height, is a well-established notion which has recently seen a resurgence of interest. We present an algorithm which---given as input an $n$-vertex graph, a tree decomposition of the graph of width $w$, and an integer $t$---decides Treedepth, i.e ...
Felix Reidl +2 more
exaly +3 more sources
PACE Solver Description: Bute-Plus: A Bottom-Up Exact Solver for Treedepth
International Symposium on Parameterized and Exact Computation, 2020 This note introduces Bute-Plus, an exact solver for the treedepth problem. The core of the solver is a positive-instance driven dynamic program that constructs an elimination tree of minimum depth in a bottom-up fashion. Three features greatly improve the algorithm's run time. The first of these is a specialised trie data structure.
James Trimble
semanticscholar +5 more sources
arXiv.org
For a graph $G$, the parameter treedepth measures the minimum depth among all forests $F$, called elimination forests, such that $G$ is a subgraph of the ancestor-descendant closure of $F$.
Benjamin Bergougnoux +2 more
semanticscholar +2 more sources
For a graph $G$, the parameter treedepth measures the minimum depth among all forests $F$, called elimination forests, such that $G$ is a subgraph of the ancestor-descendant closure of $F$.
Benjamin Bergougnoux +2 more
semanticscholar +2 more sources
PACE Solver Description: Computing Exact Treedepth via Minimal Separators
International Symposium on Parameterized and Exact Computation, 2020 This is a description of team xuzijian629’s treedepth solver submitted to PACE 2020. As we use a top-down approach, we enumerate all possible minimal separators at each step. The enumeration is sped up by several novel pruning techniques and is based on our conjecture that we can always have an optimal decomposition without using separators with size ...
Zijian Xu +2 more
semanticscholar +4 more sources
Improved Bounds for the Excluded-Minor Approximation of Treedepth
SIAM Journal on Discrete Mathematics, 2021Marcin Pilipczuk, Wojciech Nadara
exaly
Exploring the gap between treedepth and vertex cover through vertex integrity
Theoretical Computer Science, 2022Tesshu Hanaka +2 more
exaly
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space
SIAM Journal on Discrete Mathematics, 2023Michał Pilipczuk +2 more
exaly