1332 search results - page 249 / 267 » Combinatorial Algorithms |
168
click to vote
STACS
2009
Springer
16 years 20 days ago
2009
Springer
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
157
click to vote
COCO
2009
Springer
16 years 14 days ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
167
click to vote
ACMACE
2009
ACM
16 years 12 days ago
2009
ACM
Fantasy games, in which players compete to correctly predict realworld outcomes in sports, entertainment, and politics, have grown in popularity and now represent a significant po...
162
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
161
click to vote
TACAS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...