Compute Generalized Hypertree Decompositions via the use of balanced separators, in Go with a focus on parallelism.
Takes as input a hypergraph in HyperBench format or PACE Challenge 2019 format, and a width parameter (positive non-zero integer). HyperBench is a benchmark library, containing over 3000 hypergraphs from CQ and CSP instances, from industry and research.
Needs Go >= 1.12, look here for Linux, MacOS or Windows versions.
Simply run make, alternatively on platforms without the make tool, run go build
No fixed command-line interface. Use "BalancedGo -h" to see the currently supported commands. Generally, any run will require 1) a valid hypergraph, according to the formats specified above, 2) a specified width (unless the "exact" or "approx" flags are used) and 3) an algorithm to actually compute an HD or GHD (depending on the type of algorithm).