28 search results - page 6 / 6 » Problem Kernels for NP-Complete Edge Deletion Problems: Spli... |
ANOR
2005
13 years 4 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
LWA
2007
13 years 6 months ago
2007
Large, high dimensional data spaces, are still a challenge for current data clustering methods. Frequent Termset (FTS) clustering is a technique developed to cope with these chall...
AAAI
2008
13 years 5 months ago
2008
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...