Breadth-first search

Known as: Breadth first recursion, Breadth-first traversal, Breath-first search 
Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
We present preliminary results of a multi-GPU code for exploring large graphs (hundreds of millions vertices and billions of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Data-intensive, graph-based computations are pervasive in several scientific applications, and are known to to be quite… (More)
  • table 1
  • figure 6
Is this relevant?
2011
2011
Maximum flow and minimum s-t cut algorithms are used to solve several fundamental problems in computer vision. These problems… (More)
  • table 1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Breadth-first search (BFS) has wide applications in electronic design automation (EDA) as well as in other fields. Researchers… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 2
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Graph abstractions are extensively used to understand and solve challenging computational problems in various scientific and… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Recently, best-first search algorithms have been introduced that store their nodes on disk, to avoid their inherent memory… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Breadth-first search (BFS) is a basic graph exploration tech nique. We give the first external memory algorithm for sparse… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This paper examines the average page quality over time of pages downloaded during a web crawl of 328 million unique pages. We use… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
Is this relevant?