Jan 14, 2007 · In this paper, we present the new backtracking-based algorithm det-k-decomp for computing hypertree decompositions of small width.
scholar.google.com › citations
In this paper, we present the new backtracking-based algorithm det-k-decomp for computing hypertree decompositions of small width. Our benchmark evaluations ...
A tree decomposition of a reasoning problem with hypergraph H = (V;E) is a triple (T;В;Г) where T = (VT ;ET ) is a tree and В: VT ! 2V and Г: VT ! 2E.
In this paper, we present the new backtracking-based algorithm det-k-decomp for computing hypertree decompositions of small width. Our benchmark evaluations.
This paper presents the new backtracking-based algorithm det-k-decomp for computing hypertree decompositions of small width and shows that det-k-decomp ...
In this paper, we present the new backtracking-based algorithm det-k-decomp for computing hypertree decompositions of small width. Our benchmark evaluations ...
A Backtracking−Based Algorithm for Computing Hypertree−Decompositions. Georg Gottlob and Marko Samer. Journal. CoRR. Volume. abs/cs/0701083.
For details see: Marko Samer, Georg Gottlob: Backtracking-Based Algorithm for Computing Hypertree-Decompositions, ACM Journal of Experimental Algorithmics (JEA) ...
Journal article. A Backtracking−Based Algorithm for Computing Hypertree−Decompositions. Actions. Email. Email this record.
We present a backtracking procedure which, along with isomorphic component detec- tion, results in optimal hypertree decompositions. We also make the procedure ...