… 2 which compares the expected running time exponents of the naïve algorithm and the
extended k-tree algorithm. We take the same example as in Sect. 3.1, with q = 4, n = 100. …

… Note that we are saying that the complexity of a k-tree structured CSP is bounded by a linear
function in the number of variables as long as we maintain the original k-tree structure and …

… algorithm for the k-tree core of a tree with n vertices which has complexity O(kn). In Section
5 we give an alternative algorithm of constructing a k-tree … application of our algorithms to an …

… We transform the above problem to the k-tree core problem, which is as follows. We
arbitrarily select an r ∈ V (Q) and orient T into Tr. If we remove Q from Tr, we get some rooted …

… This view leads to our algorithm paradigm: For each k-clique of the embedding k-tree, we
update successively a state information for the k-clique. This state information describes …

… ’s k-tree algorithm that solves … k-tree only slightly outperforms Wagner’s k-tree. However,
in some applications this suffices, and as a proof of concept, we apply the new 3-tree algorithm …

… from a case-base on the K-tree search algorithm. Building an automated CBR system relies
on … case representation method, we introduce a K-tree search method to transform the case …

… In a second example, we show how the K tree score can be used to make an accurate
selection of orthologous genes. Orthologs should reflect the same topology of the species tree but …

… is achieved with a maximum spanning k -tree. While constructing a maximum spanning k
-tree is intractable for even k = 2 , we show that polynomial algorithms can be ensured by a …

… In this paper, we first address the question of determining the minimum value of k for
which a given graph is a partial k-tree. We show that the decision version of this PARTIAL K-TREE …