Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

32 relations
A* search algorithmBacktrackingCall stackCanadian traveller problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Iterative-deepening search with on-line tree size prediction
The memory requirements of best-first graph search algorithms such as A* often prevent them from solving large problems. The best… 
2009
2009
Situation aware UAV mission route planning
This paper outlines an agent based approach for UAV (Unmanned Air Vehicles) mission route planning problem. In this context… 
Highly Cited
2007
Highly Cited
2007
Towards Graph Containment Search and Indexing
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g e D such that q contains g… 
2005
2005
Query-Based Summarization using Rhetorical Structure Theory
Research on Question Answering is focused mainly on classifying the question type and finding the answer. Presenting the answer… 
2004
2004
Preamble computation in automated test case generation using constraint logic programming
BZ‐Testing‐Tools (BZ‐TT) is a tool‐set for automated model‐based test case generation from B abstract machines and Z… 
2001
2001
Combining Edge, Region, and Shape Information to Segment the Left Ventricle in Cardiac MR Images
This paper describes a segmentation technique to automatically extract the myocardium in 4D cardiac MR images for quantitative… 
1992
1992
Generating Netlists from Executable Circuit Specifications
A semiconductor wafer is provided with a plurality of semiconductor pellets arranged in rows and columns in a checkered pattern… 
Highly Cited
1991
Highly Cited
1991
Generation of free gait-a graph search approach
A method is presented for the generation of a free gait for the straight-line motion of a quadruped walking machine. It uses a… 
1990
1990
Motion planning with time-varying polyhedral obstacles based on graph search and mathematical programming
A method is presented for path planning of a point robot moving among polyhedral obstacles with piecewise constant translating… 
Highly Cited
1978
Highly Cited
1978
The argos image understanding system.
Abstract : ARGOS is an image understanding system. It builds a three-dimensional model of the task domain and uses hypothesized… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)