A CSP Hypergraph Library
Tobias Ganzow, Georg Gottlob, Nysret Musliu, Marko Samer · 2006
Abstract.In this report we describe a collection of hypergraphs used to evaluate our implementations of hypertree decomposition algorithms. Hypertree decomposition was introduced by Gottlob et al. [6] as new structural decomposition method in constraint satisfaction. Since hypergraphs in constraint satisfaction do not have any specific properties, they can also be used for other evaluation purposes.