We describe the FlowCutter submission to the PACE 2020 heuristic tree-depth challenge. The task of the challenge consists of computing an elimination tree of small height for a given graph. At its core our submission uses a nested dissection approach, with FlowCutter as graph bisection algorithm
Shrub-depth is a width measure of graphs which, roughly speaking, corresponds to the smallest depth ...
In this article, the Program Committee of the Second Parameterized Algorithms and Computational Expe...
The notion of tree-cut width has been introduced by Wollan in [The structure of graphs not admitting...
We describe a heuristic algorithm for computing treedepth decompositions, submitted for the https://...
We describe tdULL, an algorithm for computing treedepth decompositions of minimal depth. An implemen...
This article briefly describes the most important algorithms and techniques used in the treedepth de...
This paper introduces Tweed-Plus, a heuristic solver for the treedepth problem. The solver uses two ...
This document describes the heuristic for computing treedepth decompositions of undirected graphs us...
We describe SMS, our submission to the exact treedepth track of PACE 2020. SMS computes the treedept...
This document provides a short overview of our treedepth solver PID^{?} in the version that we submi...
The depth of a flow graph is the maximum number of back edges in an acyclic path, where a back edge ...
Branch & Reduce and dynamic programming on graphs of bounded treewidth are among the most common...
This is an experimental study of algorithms for the cut tree problem. We study the Gomory-Hu and Gus...
We present a novel algorithm for the minimum-depth elimination tree problem, which is equivalent to ...
This article briefly describes the most important algorithms and techniques used in the cluster edit...
Shrub-depth is a width measure of graphs which, roughly speaking, corresponds to the smallest depth ...
In this article, the Program Committee of the Second Parameterized Algorithms and Computational Expe...
The notion of tree-cut width has been introduced by Wollan in [The structure of graphs not admitting...
We describe a heuristic algorithm for computing treedepth decompositions, submitted for the https://...
We describe tdULL, an algorithm for computing treedepth decompositions of minimal depth. An implemen...
This article briefly describes the most important algorithms and techniques used in the treedepth de...
This paper introduces Tweed-Plus, a heuristic solver for the treedepth problem. The solver uses two ...
This document describes the heuristic for computing treedepth decompositions of undirected graphs us...
We describe SMS, our submission to the exact treedepth track of PACE 2020. SMS computes the treedept...
This document provides a short overview of our treedepth solver PID^{?} in the version that we submi...
The depth of a flow graph is the maximum number of back edges in an acyclic path, where a back edge ...
Branch & Reduce and dynamic programming on graphs of bounded treewidth are among the most common...
This is an experimental study of algorithms for the cut tree problem. We study the Gomory-Hu and Gus...
We present a novel algorithm for the minimum-depth elimination tree problem, which is equivalent to ...
This article briefly describes the most important algorithms and techniques used in the cluster edit...
Shrub-depth is a width measure of graphs which, roughly speaking, corresponds to the smallest depth ...
In this article, the Program Committee of the Second Parameterized Algorithms and Computational Expe...
The notion of tree-cut width has been introduced by Wollan in [The structure of graphs not admitting...