2487 search results - page 407 / 498 » Partitions of Graphs into Trees |
ICDE
2009
IEEE
14 years 3 months ago
2009
IEEE
— Keyword search on relational databases provides users with insights that they can not easily observe using the traditional RDBMS techniques. Here, an l-keyword query is speci...
AGILE
2009
Springer
14 years 2 months ago
2009
Springer
We study a point pattern detection problem on networks, motivated by geographical analysis tasks, such as crime hotspot detection. Given a network N (for example, a street, train,...
LICS
2008
IEEE
14 years 2 months ago
2008
IEEE
We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...
CP
2000
Springer
14 years 15 days ago
2000
Springer
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
WG
1995
Springer
13 years 11 months ago
1995
Springer
We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...