415 search results - page 38 / 83 » Optimal query complexity bounds for finding graphs |
IPL
2006
13 years 7 months ago
2006
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
CASES
2009
ACM
13 years 5 months ago
2009
ACM
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
ECCB
2005
IEEE
14 years 1 months ago
2005
IEEE
Many areas of modern biology are concerned with the management, storage, visualization, comparison, and analysis of networks. For instance, networks are used to model signal trans...
VLDB
2002
ACM
14 years 7 months ago
2002
ACM
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...