Authors
Tobias Ganzow, Georg Gottlob, Nysret Musliu, Marko Samer
Publication date
2005/6
Publisher
Technical Report, DBAI-TR-2005-50, Technische Universitt Wien
Description
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.
Total citations
Scholar articles
T Ganzow, G Gottlob, N Musliu, M Samer - Institute of Information Systems (DBAI), 2005
N Musliu, M Samer, T Ganzow, G Gottlob - Technical Report, DBAI-TR-2005-50, 2005