986 search results - page 53 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
We study the problem of navigating through a database of similar objects using comparisons. This problem is known to be strongly related to the small-world network design problem....
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) problems in the data streaming model. For t...