12 search results - page 1 / 3 » Simplified External Memory Algorithms for Planar DAGs |
SWAT
2004
Springer
15 years 3 months ago
2004
Springer
SWAT
2000
Springer
15 years 1 months ago
2000
Springer
WADS
2001
Springer
15 years 2 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
ESA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
101
click to vote
COCOON
1999
Springer
15 years 2 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...