Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,217,419 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
32 relations
A* search algorithm
Backtracking
Call stack
Canadian traveller problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Iterative-deepening search with on-line tree size prediction
E. Burns
,
Wheeler Ruml
Annals of Mathematics and Artificial Intelligence
2012
Corpus ID: 9650993
The memory requirements of best-first graph search algorithms such as A* often prevent them from solving large problems. The best…
Expand
Highly Cited
2007
Highly Cited
2007
Towards Graph Containment Search and Indexing
Cheng Chen
,
Xifeng Yan
,
Philip S. Yu
,
Jiawei Han
,
Dong-Qing Zhang
,
Xiaohui Gu
Very Large Data Bases Conference
2007
Corpus ID: 1803605
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…
Expand
2005
2005
Query-Based Summarization using Rhetorical Structure Theory
W. Bosma
The Clinician
2005
Corpus ID: 67332
Research on Question Answering is focused mainly on classifying the question type and finding the answer. Presenting the answer…
Expand
2004
2004
Preamble computation in automated test case generation using constraint logic programming
Séverine Colin
,
B. Legeard
,
F. Peureux
Software testing, verification & reliability
2004
Corpus ID: 29768599
BZ‐Testing‐Tools (BZ‐TT) is a tool‐set for automated model‐based test case generation from B abstract machines and Z…
Expand
2002
2002
Rubberband: an improved graph search algorithm for interactive object segmentation
Huitao Luo
,
A. Eleftheriadis
Proceedings. International Conference on Image…
2002
Corpus ID: 42258449
We present a novel interactive object segmentation algorithm: Rubberband. Rubberband is motivated by graph search based boundary…
Expand
2000
2000
Algorithms for the minimal cutsets enumeration of networks by graph search and branch addition
Heejong Suh
,
Carl K. Chang
Proceedings 25th Annual IEEE Conference on Local…
2000
Corpus ID: 36709891
This paper presents effective algorithms for enumerating the minimal cutsets of networks. After a graph is modeled after a…
Expand
1992
1992
Generating Netlists from Executable Circuit Specifications
J. O'Donnell
Functional Programming
1992
Corpus ID: 8652401
A semiconductor wafer is provided with a plurality of semiconductor pellets arranged in rows and columns in a checkered pattern…
Expand
Highly Cited
1991
Highly Cited
1991
Generation of free gait-a graph search approach
Prabir K. Pal
,
K. Jayarajan
IEEE Trans. Robotics Autom.
1991
Corpus ID: 41381640
A method is presented for the generation of a free gait for the straight-line motion of a quadruped walking machine. It uses a…
Expand
1985
1985
Multi-goal real-time global path planning for an autonomous land vehicle using a high-speed graph search processor
Alexandre M. Parodi
Proceedings. IEEE International Conference on…
1985
Corpus ID: 43495089
This paper presents a fast and powerful global path planning subsystem for an autonomous land vehicle (ALV). It addresses its…
Expand
Highly Cited
1978
Highly Cited
1978
The argos image understanding system.
S. Rubin
1978
Corpus ID: 60526133
Abstract : ARGOS is an image understanding system. It builds a three-dimensional model of the task domain and uses hypothesized…
Expand
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)
ACCEPT & CONTINUE