Live briefing
Everything about Graph traversal
Computer science algorithm
In computer science, graph traversal refers to the process of visiting each vertex in a graph. Such traversals are classified by the order in which the vertices are visited. Tree traversal is a special case of graph traversal. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Graph traversalA 5-minute orientation
- Skim a recent paper: TRG-Planner: Traversal Risk Graph-Based Path Planning in Unstructured Environments for Safe and Efficient NavigationInfluential work since 2022
- Pick up a classic book: Discrete Mathematics and Its ApplicationsThe most-reprinted book on the subject
- Read the landmark paper: Scalable GPU graph traversalCited 136 times
- Go sideways: Breadth-first searchA closely related topic
- Go sideways: Depth-first searchA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Scalable GPU graph traversal
The optimum traversal of a graph
Transitive closure algorithms based on graph traversal
High-Performance and Scalable GPU Graph Traversal
Mining Web navigation patterns with a path traversal graph
Exploring Graph Traversal Algorithms in Graph-Based Molecular Generation
Using the Intel Many Integrated Core to accelerate graph traversal
Extensions to query languages for graph traversal problems
🆕 Influential since 2022
TRG-Planner: Traversal Risk Graph-Based Path Planning in Unstructured Environments for Safe and Efficient Navigation
Burning Graphs Through Farthest-First Traversal
Designing a novel lossless audio compression technique with the help of optimized graph traversal (LACOGT)
Route Planning for Emergency Evacuation Using Graph Traversal Algorithms
MST: Topology-Aware Message Aggregation for Exascale Graph Processing of Traversal-Centric Algorithms
đź“š Books worth reading
Discrete Mathematics and Its ApplicationsKenneth H. Rosen · 1988
Mathematical structures for computer scienceJudith L. Gersting · 1982
Discrete mathematicsKenneth A. Ross · 1985
An introduction to computer scienceJean-Paul Tremblay, Richard B. Bunt · 1979
Data structures and algorithm analysis in CMark Allen Weiss · 1993
Introduction to graph theoryGary Chartrand, Zhang, Ping · 2004
Data structures & algorithm analysis in JavaMark Allen Weiss · 1999
Data structures and algorithms in JavaAdam Drozdek · 2001
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Breadth-first search In computer science, breadth-first search (BFS) is an algorithm for searching a tree data structure for a node that satisfies a given property. It starts…
- Depth-first search In computer science, depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root…
- Hopcroft–Karp algorithm In computer science, the Hopcroft–Karp algorithm (sometimes more accurately called the Hopcroft–Karp–Karzanov algorithm) is an algorithm that takes a bipartite…
- Bridge (graph theory) In graph theory, a bridge, isthmus, cut-edge, or cut arc is an edge of a graph whose deletion increases the graph's number of connected components. Equivalently…
- Distance (graph theory) In the mathematical field of graph theory, the distance between two vertices in a graph is the number of edges in a shortest path (also called a graph…
- Cycle (graph theory) In graph theory, a cycle in a graph is a non-empty trail in which only the first and last vertices are equal. A directed cycle in a directed graph is a…
- Graph (abstract data type) In computer science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from the field of graph…
- Connectivity (graph theory) In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges)…