139 search results - page 4 / 28 » Parallel external memory graph algorithms |
WADS
2001
Springer
13 years 10 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
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
ESA
1998
Springer
13 years 9 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
VLDB
1999
ACM
13 years 10 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...
PROPERTYTESTING
2010
13 years 3 months ago
2010
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...