Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,342,348 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.
2016
2016
Loopfrog - loop summarization for static analysis
D. Kroening
,
N. Sharygina
,
S. Tonetta
,
Aliaksei Tsitovich
,
C. Wintersteiger
WING@ETAPS/IJCAR
2016
Corpus ID: 12524923
LOOPFROG is a scalable static analyzer for ANSI-C programs, that combines the precision of model checking and the performance of…
Expand
2015
2015
An Algorithm to Calculate Semantic Distance among Indirect Question Referents
L. Sharma
,
Namita Mittal
2015
Corpus ID: 212523794
,
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
2009
2009
Internal and External Remerge On Movement , Multidominance , and the Linearization of Syntactic Objects
M. D. De 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
2004
2004
Locating and Crossing Doors and Narrow Passages for a Mobile Robot
Zhiyu 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
2002
2002
Image Segmentation Based on Shape Space Modeling
Daehee Kim
,
Yo-Sung Ho
EurAsian Conference on Information and…
2002
Corpus ID: 18179896
In this paper, we propose a new image segmentation method based on the active contour. If we define a shape space as a set of all…
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
1988
1988
A frame architecture for a certain class of graph search problems
B. Sy
,
J. Deller
IEEE Transactions on Systems, Man and Cybernetics
1988
Corpus ID: 44855235
A frame control strategy is presented which directs an efficient graph search when information available for finding a path is…
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