Learn More
In the past a number of I/O-efficient algorithms were designed to solve a problem on a static data set. However, many data sets like social networks or web graphs change their shape frequently. We provide experimental results of the first external-memory dynamic breadth-first search (BFS) implementation based on earlier theoretical work [13] that crucially(More)
Afundamental step in the analysis of amassive graph is to compute its diameter .I nthe RAM model, the diameter of aconnected undirected unweighted graph can be efficiently 2-approximated using aBreadth-First Search (BFS) traversal from an arbitrary node. However, if the graph is stored on disk, even an external memory BFS traversal is prohibitive,o wing to(More)
  • 1