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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
The memory requirements of best-first graph search algorithms such as A* often prevent them from solving large problems. The best… 
Highly Cited
2007
Highly Cited
2007
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
Research on Question Answering is focused mainly on classifying the question type and finding the answer. Presenting the answer… 
2004
2004
BZ‐Testing‐Tools (BZ‐TT) is a tool‐set for automated model‐based test case generation from B abstract machines and Z… 
2002
2002
We present a novel interactive object segmentation algorithm: Rubberband. Rubberband is motivated by graph search based boundary… 
2000
2000
This paper presents effective algorithms for enumerating the minimal cutsets of networks. After a graph is modeled after a… 
1992
1992
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
A method is presented for the generation of a free gait for the straight-line motion of a quadruped walking machine. It uses a… 
1985
1985
This paper presents a fast and powerful global path planning subsystem for an autonomous land vehicle (ALV). It addresses its… 
Highly Cited
1978
Highly Cited
1978
Abstract : ARGOS is an image understanding system. It builds a three-dimensional model of the task domain and uses hypothesized…