13 search results - page 2 / 3 » Some Connections Between Bounded Query Classes and Non-Unifo... |
STOC
2004
ACM
14 years 6 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
ICDE
2008
IEEE
14 years 7 months ago
2008
IEEE
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
COMPGEOM
2009
ACM
14 years 24 days ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
STACS
2007
Springer
14 years 11 days ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
ISAAC
2005
Springer
13 years 11 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...