Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,977,010 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
2010
2010
Edge Partitioning in Parallel Structured Duplicate Detection
R. Zhou
,
Tim-Christian Schmidt
,
E. Hansen
,
M. Do
,
S. Uckun
Symposium on Combinatorial Search
2010
Corpus ID: 43248511
We show how edge partitioning, a technique originally developed for external-memory search, can be used to reduce the number…
Expand
2009
2009
Internal and External Remerge On Movement , Multidominance , and the Linearization of Syntactic Objects
M. Vries
2009
Corpus ID: 16093241
This article centers around two questions: (i) what is the relation between movement and structure sharing?, and (ii) how can…
Expand
2007
2007
Cell-based Probabilistic Roadmaps (CPRM) for Efficient Path Planning in Large Environments
K. Klasing
,
D. Wollherr
,
M. Buss
2007
Corpus ID: 18939000
This paper presents a novel sampling-based path planning method called Cell-based Probabilistic Roadmaps (CPRM). The algorithm…
Expand
2006
2006
A Linear-time Algorithm for Finding a Maximal Planar Subgraph *
H. Djidjev
2006
Corpus ID: 12789644
We construct an optimal linear-time algorithm for the maximal planar subgraph problem: given a graph G, find a planar subgraph 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
Locating and Crossing Doors and Narrow Passages for a Mobile Robot
Z. Xiang
,
Vítor M. F. Santos
,
Jilin Liu
International Conference on Informatics in…
2004
Corpus ID: 9635261
In structured indoor environment, the structural information gathered from sensors can be divided into three different levels…
Expand
1994
1994
Distributivity in Incompletely Speciied Type Hierarchies: Theory and Computational Complexity
DistributivityinIncompletely Speci
1994
Corpus ID: 16396960
Type hierarchies are a central feature of current systems which employ feature structures for the representation and manipulation…
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