7129 search results - page 165 / 1426 » Approximation Algorithms for Treewidth |
143
Voted
ADBIS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. XML query processors suffer from main-memory limitations that prevent them from processing large XML documents. While content-based predicates can be used to project down...
138
Voted
GD
2006
Springer
15 years 7 months ago
2006
Springer
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
148
Voted
AAAI
2010
15 years 5 months ago
2010
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...
104
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
128
Voted
ICTAI
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper, we introduce a new partial consistency for constraint networks which is called Structural Consistency of level w and is denoted w-SC consistency. This consistency i...