Sciweavers

Share
7 search results - page 1 / 2
» Planar Graph Blocking for External Searching
Sort
View
FSTTCS
2000
Springer
9 years 6 months ago
Planar Graph Blocking for External Searching
We present a new scheme for storing a planar graph in external memory so that any online path can be traversed in an I-O efficient way. Our storage scheme significantly improves th...
Surender Baswana, Sandeep Sen
PODS
1993
ACM
161views Database» more  PODS 1993»
9 years 6 months ago
Blocking for External Graph Searching
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott...
WADS
2001
Springer
126views Algorithms» more  WADS 2001»
9 years 7 months ago
On External-Memory Planar Depth First Search
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...
Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
COCOON
1999
Springer
9 years 6 months ago
An External Memory Data Structure for Shortest Path Queries
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...
David A. Hutchinson, Anil Maheshwari, Norbert Zeh
ISAAC
2005
Springer
118views Algorithms» more  ISAAC 2005»
9 years 8 months ago
External Data Structures for Shortest Path Queries on Planar Digraphs
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
Lars Arge, Laura Toma
books