2612 search results - page 136 / 523 » Switching Graphs and Their Complexity |
107
click to vote
PODS
2001
ACM
15 years 10 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
MOBIHOC
2007
ACM
15 years 9 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
GEOS
2007
Springer
15 years 4 months ago
2007
Springer
Spatial and temporal data are critical components in many applications. This is especially true in analytical domains such as national security and criminal investigation. Often, t...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The Jordan Curve Theorem (JCT) states that a simple closed curve divides the plane into exactly two connected regions. We formalize and prove the theorem in the context of grid gr...
OTM
2010
Springer
14 years 8 months ago
2010
Springer
In this paper we deal with problems occurring in evolving interrelated Web databanks. Examples of such databanks are networks of interlinked scientific repositories on the Web, man...