Bute: A Bottom-Up Exact Solver for Treedepth (Submitted to PACE 2020 under username peaty)

06/17/2020
by   James Trimble, et al.
0

This note introduces the exact solver Bute for the exact treedepth problem, along with two variants of the solver. Each of these solvers computes an elimination tree in a bottom-up fashion by finding sets of vertices that induce subgraphs of small treedepth, then combining sets of vertices together with a root vertex to produce larger sets. The algorithms make use of a trie data structure to reduce the effort required to determine acceptable combinations of subtrees. Bute-Plus and Bute-Plus-Plus add a heuristic presolve step, which can quickly find a treedepth decomposition of optimal depth for many instances.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/02/2016

Improving SAT Solvers via Blocked Clause Decomposition

The decision variable selection policy used by the most competitive CDCL...
research
02/10/2021

An exact solver for the Weston-Watkins SVM subproblem

Recent empirical evidence suggests that the Weston-Watkins support vecto...
research
10/05/2020

A Note on Exponential-Time Algorithms for Linearwidth

In this note, we give an algorithm that computes the linearwidth of inpu...
research
04/19/2020

An Algorithm for the Exact Treedepth Problem

We present a novel algorithm for the minimum-depth elimination tree prob...
research
08/01/2022

Reduction Rules and ILP Are All You Need: Minimal Directed Feedback Vertex Set

This note describes the development of an exact solver for Minimal Direc...

Please sign up or login with your details

Forgot password? Click here to reset