139 search results - page 3 / 28 » Parallel external memory graph algorithms |
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this proble...
SWAT
2000
Springer
13 years 8 months ago
2000
Springer
PDP
2007
IEEE
13 years 11 months ago
2007
IEEE
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
IJCAI
2007
13 years 6 months ago
2007
There is currently much interest in using external memory, such as disk storage, to scale up graph-search algorithms. Recent work shows that the local structure of a graph can be ...
HIPC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. The theory of bulk-synchronous parallel computing has produced a large number of attractive algorithms, which are provably optimal in some sense, but typically require th...