The topic of the PACE (Parameterized Algorithms and Computational Experiments) 2023 challenge (https://pacechallenge.org/2023/) is twinwidth (https://en.wikipedia.org/wiki/Twin-width). In the heuristic track of PACE 2023 the aim is to find contraction sequences of small width. Our solver, METATWW, uses a two-phase approach. In phase one it finds an initial contraction sequence by contracting pairs of vertices where the size of the symmetric difference between their neighbourhoods is small. In phase two we iteratively move contractions around within specific intervals of the contraction sequence in order to reduce the width of the sequence. Contact: williambillemeyling@gmail.com (William Bille Meyling)Contact: williambillemeyling@gmail.com ...
This document describes our exact Cluster Editing solver, PaSTEC, which got the third place in the 2...
A treedepth solver based on the algorithm described on A Faster Parameterized Algorithm for Treedept...
This software computes a hypertree width of smallest size of a hypergraph. It has been submitted to ...
Source code of the solver for PACE 2023 Twin-width (https://pacechallenge.org/2023/)
This repository contains the exact and heuristic solver Zygosity. It was submited in the exact and t...
Branch and reduce solver branching on possible merges within small distance. Submission for PACE 202...
In this article, the Program Committee of the Second Parameterized Algorithms and Computational Expe...
Hybrid Approach to Twinwidth by Taming Red (HATTER)' is a novel heuristic solver for computing the t...
The organizers of the 4th Parameterized Algorithms and Computational Experiments challenge (PACE 201...
The Bipartite Contraction problem is to decide, given a graph G and a parameter k, whether we can ob...
International audienceA contraction sequence of a graph consists of iteratively merging two of its v...
International audienceThe Program Committee of the Third Parameterized Algorithms and Computational ...
This software computes a hypertree width of smallest size of a hypergraph. It has been submitted to ...
Abstract. The Bipartite Contraction problem is to decide, given a graph G and a parameter k, whether...
Tensor networks are powerful factorization techniques which reduce resource requirements for numeric...
This document describes our exact Cluster Editing solver, PaSTEC, which got the third place in the 2...
A treedepth solver based on the algorithm described on A Faster Parameterized Algorithm for Treedept...
This software computes a hypertree width of smallest size of a hypergraph. It has been submitted to ...
Source code of the solver for PACE 2023 Twin-width (https://pacechallenge.org/2023/)
This repository contains the exact and heuristic solver Zygosity. It was submited in the exact and t...
Branch and reduce solver branching on possible merges within small distance. Submission for PACE 202...
In this article, the Program Committee of the Second Parameterized Algorithms and Computational Expe...
Hybrid Approach to Twinwidth by Taming Red (HATTER)' is a novel heuristic solver for computing the t...
The organizers of the 4th Parameterized Algorithms and Computational Experiments challenge (PACE 201...
The Bipartite Contraction problem is to decide, given a graph G and a parameter k, whether we can ob...
International audienceA contraction sequence of a graph consists of iteratively merging two of its v...
International audienceThe Program Committee of the Third Parameterized Algorithms and Computational ...
This software computes a hypertree width of smallest size of a hypergraph. It has been submitted to ...
Abstract. The Bipartite Contraction problem is to decide, given a graph G and a parameter k, whether...
Tensor networks are powerful factorization techniques which reduce resource requirements for numeric...
This document describes our exact Cluster Editing solver, PaSTEC, which got the third place in the 2...
A treedepth solver based on the algorithm described on A Faster Parameterized Algorithm for Treedept...
This software computes a hypertree width of smallest size of a hypergraph. It has been submitted to ...