Graph traversal

Known as: Graph exploration algorithm, Graph search, Graph search algorithm 
In computer science, graph traversal (also known as graph search) refers to the process of visiting (checking and/or updating) each vertex in a graph… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The Breadth-First Search (BFS) algorithm serves as the foundation for many graph-processing applications and analytics workloads… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2015
2015
Breadth-First Search (BFS) is a core primitive for graph traversal and a basis for many higher-level graph analysis algorithms… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2015
2015
Gremlin is a graph traversal machine and language designed, developed, and distributed by the Apache TinkerPop project. Gremlin… (More)
Is this relevant?
Highly Cited
2013
Highly Cited
2013
There has been significant recent interest in parallel frameworks for processing graphs due to their applicability in studying… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Breadth-first search (BFS) is a core primitive for graph traversal and a basis for many higher-level graph analysis algorithms… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Processing large graphs is becoming increasingly important for many domains such as social networks, bioinformatics, etc… (More)
  • figure 1
  • figure 3
  • figure 2
  • table I
  • figure 4
Is this relevant?
Highly Cited
2010
Highly Cited
2010
A graph is a structure composed of a set of vertices (i.e. nodes, dots) connected to one another by a set of edges (i.e. links… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Query processing over graph-structured data is enjoying a growing number of applications. A top-k keyword search query on a graph… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We describe a new external memory data structure, the buffered repository tree, and use it to provide the first non-trivial… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Several graph-based algorithms have been proposed in the literature to compute the transitive closure of a directed graph. We… (More)
  • table I
  • table II
  • table III
  • figure 2
  • figure 3
Is this relevant?