937 search results - page 131 / 188 » On the Complexity of Partial Order Properties |
162
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
157
click to vote
CP
2007
Springer
16 years 7 days ago
2007
Springer
Abstract. This paper deals with the problem of solving efficiently structured CSPs. It is well known that (hyper)tree-decompositions offer the best approaches from a theoretical v...
185
click to vote
CSR
2007
Springer
16 years 7 days ago
2007
Springer
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
157
click to vote
ANCS
2006
ACM
16 years 1 days ago
2006
ACM
Load balancing in packet-switched networks is a task of ever-growing importance. Network traffic properties, such as the Zipf-like flow length distribution and bursty transmissio...
142
click to vote
ANSS
2005
IEEE
15 years 11 months ago
2005
IEEE
The Internet is a large, complex, heterogeneous system operating at very high speeds and consisting of a large number of users. Researchers use a suite of tools and techniques in ...