A treedepth solver based on the algorithm described on A Faster Parameterized Algorithm for Treedepth (Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil and Somnath Sikdar). As this solver needs a treewidth decomposition of the input graph in order to work, a solver presented at PACE 2017 is included in the folder Tamaki-PACE-2017
We describe SMS, our submission to the exact treedepth track of PACE 2020. SMS computes the treedept...
Motivated by the desire to speed up dynamic programming algorithms for graphs of bounded treewidth,...
We give an algorithm that for an input n-vertex graph G and integer k>0, in time 2^[O(k)]n either...
We describe tdULL, an algorithm for computing treedepth decompositions of minimal depth. An implemen...
This paper introduces Tweed-Plus, a heuristic solver for the treedepth problem. The solver uses two ...
A solver for hypertree decompositions that was created for PACE 2019 (https://pacechallenge.org/2019...
DAIA is a two-phases heuristic algorithm that searches for good treedepth decompositions of graphs. ...
We describe a heuristic algorithm for computing treedepth decompositions, submitted for the https://...
In this thesis we present several results relating to treedepth. First, we provide the fastest linea...
The notions of pathwidth and the closely related treewidth have become more and more important recen...
This document describes the heuristic for computing treedepth decompositions of undirected graphs us...
This article briefly describes the most important algorithms and techniques used in the treedepth de...
Dans cette thèse, nous étudions la complexité paramétrée de problèmes combinatoires dans les graphes...
The notion of treewidth is of considerable interest in relation to NP-hard problems. Indeed, severa...
Many NP-complete graph problems can be solved in polynomial time for graphs with bounded treewidth. ...
We describe SMS, our submission to the exact treedepth track of PACE 2020. SMS computes the treedept...
Motivated by the desire to speed up dynamic programming algorithms for graphs of bounded treewidth,...
We give an algorithm that for an input n-vertex graph G and integer k>0, in time 2^[O(k)]n either...
We describe tdULL, an algorithm for computing treedepth decompositions of minimal depth. An implemen...
This paper introduces Tweed-Plus, a heuristic solver for the treedepth problem. The solver uses two ...
A solver for hypertree decompositions that was created for PACE 2019 (https://pacechallenge.org/2019...
DAIA is a two-phases heuristic algorithm that searches for good treedepth decompositions of graphs. ...
We describe a heuristic algorithm for computing treedepth decompositions, submitted for the https://...
In this thesis we present several results relating to treedepth. First, we provide the fastest linea...
The notions of pathwidth and the closely related treewidth have become more and more important recen...
This document describes the heuristic for computing treedepth decompositions of undirected graphs us...
This article briefly describes the most important algorithms and techniques used in the treedepth de...
Dans cette thèse, nous étudions la complexité paramétrée de problèmes combinatoires dans les graphes...
The notion of treewidth is of considerable interest in relation to NP-hard problems. Indeed, severa...
Many NP-complete graph problems can be solved in polynomial time for graphs with bounded treewidth. ...
We describe SMS, our submission to the exact treedepth track of PACE 2020. SMS computes the treedept...
Motivated by the desire to speed up dynamic programming algorithms for graphs of bounded treewidth,...
We give an algorithm that for an input n-vertex graph G and integer k>0, in time 2^[O(k)]n either...
DOI
Add to ORKG