AI Chat AI Image Generator AI Video AI Music Generator

Sallow: a heuristic algorithm for treedepth decompositions

06/12/2020

∙

by Marcin Wrochna, et al.

∙

∙

We describe a heuristic algorithm for computing treedepth decompositions, submitted for the PACE 2020 challenge. It relies on a variety of greedy algorithms computing elimination orderings, as well as a Divide Conquer approach on balanced cuts obtained using a from-scratch reimplementation of the 2016 FlowCutter algorithm by Hamann Strasser [ACM JEA 2018].

page 1

page 2

page 3

page 4

research

∙ 12/21/2017

A non-commutative algorithm for multiplying (7 × 7) matrices using 250 multiplications

We present a non-commutative algorithm for multiplying (7x7) matrices us...

0 Alexandre Sedoglavic, et al. ∙

research

∙ 04/28/2021

Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth

Modern trends in data collection are bringing current mainstream techniq...

0 Georg Gottlob, et al. ∙

research

∙ 08/31/2022

A heuristic algorithm for the maximum happy vertices problem using tree decompositions

We propose a new heuristic algorithm for the Maximum Happy Vertices prob...

0 Louis Carpentier, et al. ∙

research

∙ 01/16/2018

Combinatorial Preconditioners for Proximal Algorithms on Graphs

We present a novel preconditioning technique for proximal optimization m...

0 Thomas Möllenhoff, et al. ∙

research

∙ 06/11/2020

GR decompositions and their relations to Cholesky-like factorizations

For a given matrix, we are interested in computing GR decompositions A=G...

0 Peter Benner, et al. ∙

research

∙ 10/23/2018

On orthogonal symmetric chain decompositions

The n-cube is the poset obtained by ordering all subsets of {1,...,n} by...

0 Karl Däubel, et al. ∙

research

∙ 06/13/2012

Bounding Search Space Size via (Hyper)tree Decompositions

This paper develops a measure for bounding the performance of AND/OR sea...

0 Lars Otten, et al. ∙