Add to ORKGWe describe a new external memory data structure, the buffered repository tree, and use it to provide the first non-trivial external memory algorithm for directed breadth-first search (BFS) and an improved external algorithm for directed depth-first search. We also demonstrate the equivalence of various formulations of external undirected BFS, and we use these to give the first I/O-optimal BFS algorithm for undirected trees
We present external memory algorithms for outerplanarity testing, embedding outerplanar graphs, brea...
ALEXNEX07/ ANACO04: Workshop on Algorithm Engineering & Experiments, 6 January 2007, Astor Crowne P...
In this paper we develop a technique for transforming an internal memory datastructure into an exter...
Breadth-first search (BFS) is a basic graph exploration technique. We give the first external memor...
We give the first external memory algorithm for breadth-first search (BFS) which achieves $o(n)$ I/O...
Breadth-first search (BFS) is a basic graph exploration technique. We give the first external-memory...
Modern day’s databases contain over hundred gigabytes to petabytes of information. For efficient and...
We give the first external memory algorithm for breadth-first search (BFS) which achieves o(n) I/Os ...
Breadth First Search (BFS) traversal is an archetype for many important graph problems. However, com...
Breadth first search (BFS) traversal on massive graphs in external memory was considered non-viable ...
The Seventeenth Annual ACM-SIAM Symposium on Discrete Algorith (SODA \u2706), Miami, Florida, 22-26 ...
Gao, Guang R.Analysis of massive graphs has emerged as an important area for massively parallel comp...
9th Implementation Challenge of DIMACS, the Center for Discrete Mathematics and Theoretical Computer...
. The well-known B-tree data structure provides a mechanism for dynamically maintaining balanced bin...
In many different areas of computing, problems can arise which are too large to fit in main memory. ...
We present external memory algorithms for outerplanarity testing, embedding outerplanar graphs, brea...
ALEXNEX07/ ANACO04: Workshop on Algorithm Engineering & Experiments, 6 January 2007, Astor Crowne P...
In this paper we develop a technique for transforming an internal memory datastructure into an exter...
Breadth-first search (BFS) is a basic graph exploration technique. We give the first external memor...
We give the first external memory algorithm for breadth-first search (BFS) which achieves $o(n)$ I/O...
Breadth-first search (BFS) is a basic graph exploration technique. We give the first external-memory...
Modern day’s databases contain over hundred gigabytes to petabytes of information. For efficient and...
We give the first external memory algorithm for breadth-first search (BFS) which achieves o(n) I/Os ...
Breadth First Search (BFS) traversal is an archetype for many important graph problems. However, com...
Breadth first search (BFS) traversal on massive graphs in external memory was considered non-viable ...
The Seventeenth Annual ACM-SIAM Symposium on Discrete Algorith (SODA \u2706), Miami, Florida, 22-26 ...
Gao, Guang R.Analysis of massive graphs has emerged as an important area for massively parallel comp...
9th Implementation Challenge of DIMACS, the Center for Discrete Mathematics and Theoretical Computer...
. The well-known B-tree data structure provides a mechanism for dynamically maintaining balanced bin...
In many different areas of computing, problems can arise which are too large to fit in main memory. ...
We present external memory algorithms for outerplanarity testing, embedding outerplanar graphs, brea...
ALEXNEX07/ ANACO04: Workshop on Algorithm Engineering & Experiments, 6 January 2007, Astor Crowne P...
In this paper we develop a technique for transforming an internal memory datastructure into an exter...