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… 
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… 
2005
2005
Planar graph routing on geographical clusters
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… 
2002
2002
Rubberband: an improved graph search algorithm for interactive object segmentation
We present a novel interactive object segmentation algorithm: Rubberband. Rubberband is motivated by graph search based boundary… 
2000
2000
Algorithms for the minimal cutsets enumeration of networks by graph search and branch addition
This paper presents effective algorithms for enumerating the minimal cutsets of networks. After a graph is modeled after a… 
Highly Cited
1997
Highly Cited
1997
Tolerance analysis for setup planning: A graph theoretical approach
Setup planning is the act of preparing detailed work instructions for setting up a part. The purpose of setting up a part is to… 
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
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)