139 search results - page 5 / 28 » Parallel external memory graph algorithms |
ICDCS
1994
IEEE
15 years 1 months ago
1994
IEEE
ISAAC
2005
Springer
15 years 3 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...
HPCC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
CGF
2000
14 years 9 months ago
2000
In this paper, we propose a novel external-memory algorithm to support view-dependent simplification for datasets much larger than main memory. In the preprocessing phase, we use ...