# Graph traversal

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- SC15: International Conference for Highâ€¦
- 2015

The Breadth-First Search (BFS) algorithm serves as the foundation for many graph-processing applications and analytics workloadsâ€¦Â (More)

Is this relevant?

2015

2015

- TOPC
- 2015

Breadth-First Search (BFS) is a core primitive for graph traversal and a basis for many higher-level graph analysis algorithmsâ€¦Â (More)

Is this relevant?

2015

2015

- DBPL
- 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

- PPOPP
- 2013

There has been significant recent interest in parallel frameworks for processing graphs due to their applicability in studyingâ€¦Â (More)

Is this relevant?

Highly Cited

2012

Highly Cited

2012

- PPOPP
- 2012

Breadth-first search (BFS) is a core primitive for graph traversal and a basis for many higher-level graph analysis algorithmsâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- ACM/IEEE International Conference for Highâ€¦
- 2010

Processing large graphs is becoming increasingly important for many domains such as social networks, bioinformatics, etcâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- Graph Data Management
- 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)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- SIGMOD Conference
- 2007

Query processing over graph-structured data is enjoying a growing number of applications. A top-k keyword search query on a graphâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- SODA
- 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

- ACM Trans. Database Syst.
- 1993

Several graph-based algorithms have been proposed in the literature to compute the transitive closure of a directed graph. Weâ€¦Â (More)

Is this relevant?