3 search results - page 1 / 1 » Memory Efficient, Self-Stabilizing Algorithm to Construct BF... |
PODC
1997
ACM
13 years 10 months ago
1997
ACM
COCOON
1999
Springer
13 years 10 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...
COMPGEOM
2006
ACM
13 years 9 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...