415 search results - page 15 / 83 » Optimal query complexity bounds for finding graphs |
107
click to vote
ALMOB
2006
14 years 11 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
214
Voted
ICDT
2009
ACM
16 years 11 days ago
2009
ACM
A technique called user views has recently been proposed to focus user attention on relevant information in response to provenance queries over workflow executions [1, 2]: Given u...
100
Voted
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of...
102
Voted
CORR
2012
Springer
13 years 7 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
100
click to vote
ALGORITHMICA
2010
14 years 11 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...