This software computes a tree-decomposition of the smallest width of a given graph. It is part of a submission to the tw-exact track of the first Parameterized Algorithms and Computational Experiments Challenge (PACE 2016). The algorithm is sequential and implemented in C99.
Read the graph in the .gr format from the standard input and write the resulting tree-decomposition in the .td format to the standard output. See the PACE site linked above for these file formats.
./tw-exact
Run make. In case of problems, try make clean and then make.
This project is licensed under the MIT License - see the LICENSE file for details