5889 search results - page 219 / 1178 » Graph Layout Problems |
201
click to vote
ICDT
2007
ACM
16 years 20 days ago
2007
ACM
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
148
click to vote
ESA
2005
Springer
16 years 1 days ago
2005
Springer
In this paper, we will describe some heuristics that can be used to improve the runtime of a wide range of commonly used algorithms for the negative cycle detection problem signiï¬...
175
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
166
click to vote
ICALP
1990
Springer
15 years 10 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
153
click to vote
PPSN
2000
Springer
15 years 10 months ago
2000
Springer
In the design of communication networks, robustness against failures in single links or nodes is an important issue. This paper proposes a new approach for the NP-complete edge-bic...