Results 1  10
of
3,194
A computational study of externalmemory BFS algorithms
 In SODA
, 2006
"... Breadth First Search (BFS) traversal is an archetype for many important graph problems. However, computing a BFS level decomposition for massive graphs was considered nonviable so far, because of the large number of I/Os it incurs. This paper presents the first experimental evaluation of recent exte ..."
Abstract

Cited by 25 (3 self)
 Add to MetaCart
externalmemory BFS algorithms for general graphs. With our STXXL based implementations exploiting pipelining and diskparallelism, we were able to compute the BFS level decomposition of a webcrawl based graph of around 130 million nodes and 1.4 billion edges in less than 4 hours using single disk and 2
A Computational Study of ExternalMemory BFS Algorithms*
"... 1 Introduction Solving real world optimization problems often boilsdown to traversing graphs in a structured way. Breadth First Search (BFS) is among the most fundamental suchtraversal strategies. It decomposes the input graph G = (V, E) of n nodes and m edges into at most n levelswhere level ..."
Abstract
 Add to MetaCart
1 Introduction Solving real world optimization problems often boilsdown to traversing graphs in a structured way. Breadth First Search (BFS) is among the most fundamental suchtraversal strategies. It decomposes the input graph G = (V, E) of n nodes and m edges into at most n levelswhere level
External memory bfs on undirected graphs with bounded degree
 In Proceedings of SODA’2001
, 2001
"... We give the first external memory algorithm for breadthfirst search (BFS) which achieves o(n) I/Os on arbitrary undirected graphs with n nodes and maximum node degree d. Let M and B> d denote the main memory size and block size, respectively. Using Sort(x) = O( ~.IOgM/B ~), our algorithm needs ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
We give the first external memory algorithm for breadthfirst search (BFS) which achieves o(n) I/Os on arbitrary undirected graphs with n nodes and maximum node degree d. Let M and B> d denote the main memory size and block size, respectively. Using Sort(x) = O( ~.IOgM/B ~), our algorithm needs
Externalmemory Multimaps
, 2011
"... Many data structures support dictionaries, also known as maps or associative arrays, which store and manage a set of keyvalue pairs. A multimap is generalization that allows multiple values to be associated with the same key. For example, the inverted file data structure that is used prevalently in ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
used to achieve our results is a combination of cuckoo hashing using buckets that hold multiple items with a multiqueue implementation to cope with varying numbers of values per key. Our externalmemory results are for the standard twolevel memory model.
Minimizing Writes in Parallel External Memory Search
 PROCEEDINGS OF THE TWENTYTHIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE
"... Recent research on externalmemory search has shown that disks can be effectively used as secondary storage when performing large breadthfirst searches. We introduce the WriteMinimizing BreadthFirst Search (WMBFS) algorithm which is designed to minimize the number of writes performed in an extern ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
in an externalmemory BFS. WMBFS is also designed to store the results of the BFS for later use. We present the results of a BFS on a singleagent version of Chinese Checkers and the Rubik’s Cube edge cubes, state spaces with about 1 trillion states each. In evaluating against a comparable approach, WMBFS
ON DYNAMIC BREADTHFIRST SEARCH IN EXTERNALMEMORY
"... We provide the first nontrivial result on dynamic breadthfirst search (BFS) in externalmemory: For general sparse undirected graphs of initially n nodes and O(n) edges and monotone update sequences of either Θ(n) edge insertions or Θ(n) edge deletions, we prove an amortized highprobability boun ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We provide the first nontrivial result on dynamic breadthfirst search (BFS) in externalmemory: For general sparse undirected graphs of initially n nodes and O(n) edges and monotone update sequences of either Θ(n) edge insertions or Θ(n) edge deletions, we prove an amortized high
An ExternalMemory Data Structure for Shortest Path Queries
, 1999
"... In this paper, we present results related to satisfying shortest path queries on a planar graph stored in external memory. N denotes the total number of vertices and edges in the graph and sort(N) denotes the number of input/output (I/O) operations required to sort an array of length N . 1) We desc ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
In this paper, we present results related to satisfying shortest path queries on a planar graph stored in external memory. N denotes the total number of vertices and edges in the graph and sort(N) denotes the number of input/output (I/O) operations required to sort an array of length N . 1) We
An externalmemory data structure for shortest path queries
 DIPLOMARBEIT, FRIEDRICHSCHILLERUNIVERSITIT JENA, NOV,1998
, 1998
"... ..."
Results 1  10
of
3,194