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.
2010
2010
A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
In this paper we present a heuristic method to generate constrained two-dimensional guillotine cutting patterns. This problem… 
Highly Cited
2009
Highly Cited
2009
On Multidominance and Linearization
This article centers around two questions: What is the relation between movement and structure sharing, and how can complex… 
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… 
2006
2006
Robust, Almost Constant Time Shortest-Path Queries in Road Networks
When you drive to somewhere ‘far away’, you will leave your current location via one of only a few ‘important’ traffic junctions… 
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… 
Highly Cited
1999
Highly Cited
1999
Test sequencing algorithms with unreliable tests
In this paper, we consider imperfect test sequencing problems under a single fault assumption. This is a partially observed… 
1996
1996
A graph-based approach to disassembly model for end-of-life product recycling
  • H. ZhangT. Kuo
  • Nineteenth IEEE/CPMT International Electronics…
  • 1996
  • Corpus ID: 6138055
Manufacturing industries are beginning to face one of the consequences resulting from the rapid development which has occurred… 
1995
1995
Stably supported rotations of a planar polygon with two frictionless contacts
  • T. AbellM. Erdmann
  • Proceedings IEEE/RSJ International Conference on…
  • 1995
  • Corpus ID: 9329825
Explores the use of stable support in robotic manipulation. Stable support describes any contact configuration which balances a… 
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… 
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)