53 search results - page 4 / 11 » On external memory graph traversal |
WADS
2001
Springer
14 years 2 days 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...
VLDB
1999
ACM
13 years 12 months ago
1999
ACM
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, resp...
PODS
1993
ACM
13 years 11 months ago
1993
ACM
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...
FTTCS
2006
13 years 7 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
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...