53 search results - page 3 / 11 » On external memory graph traversal |
IJCAI
2007
13 years 9 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 ...
SWAT
2000
Springer
13 years 11 months ago
2000
Springer
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We provide the first non-trivial result on dynamic breadth-first search (BFS) in external-memory: For general sparse undirected graphs of initially n nodes and O(n) edges and monot...
IFIP
2004
Springer
14 years 1 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...