-----
What:
-----
This is the readme file for the Treewidth Computation Partial MaxSAT datasets.
----------
References
----------
The datasets are the product of the following paper:
SAT-Based Approaches to Treewidth Computation: An Evaluation. Jeremias Berg and Matti Järvisalo.
In Proceedings of the 2014 IEEE 26th International Conference on Tools with Artificial Intelligence (ICTAI 2014),
pages 328-335. IEEE Computer Society, 2014.
-----------------------
Datasets
-----------------------
These instances are all based on the linear ordering characterization of treewidth computation.
The MaxSAT instances were created from 38 different undirected graphs.
Several real world graph coloring benchmarks obtainable from
http://www.staff.science.uu.nl/~bodla101/treewidthlib/coloring.zip
Some Bayesian networks available from the UCI repository http://archive.ics.uci.edu/ml/
As well as previously used TW computation benchmarks available at
http://www.cs.uu.nl/research/projects/treewidthlib/
-----------
FILE NAMES
-----------
Files are named following convention:
TWComp__N.wcnf
where
= Name of the graph used
= The number of nodes in the graph.
-------
CONTACT
-------
In case of questions please check the original paper first, then you can contact:
Jeremias Berg
email: jeremias.berg@cs.helsinki.fi