61 search results - page 10 / 13 » Lower bounds for graph embeddings and combinatorial precondi... |
STACS
2000
Springer
13 years 9 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
GIS
2007
ACM
14 years 7 months ago
2007
ACM
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
SCOPES
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
PODS
2001
ACM
14 years 6 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...
WADS
2005
Springer
13 years 11 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...