Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,350,558 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.
Highly Cited
2011
Highly Cited
2011
A Distributed Algorithm for Web Service Composition Based on Service Agent Model
H. Tong
,
Jian Cao
,
Shensheng Zhang
,
Minglu Li
IEEE Transactions on Parallel and Distributed…
2011
Corpus ID: 16082847
Agent-based service composition has provided a promising computing paradigm for the automatic web service composition. In this…
Expand
Highly Cited
2009
Highly Cited
2009
On Multidominance and Linearization
De Vries
2009
Corpus ID: 13353010
This article centers around two questions: What is the relation between movement and structure sharing, and how can complex…
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
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
2001
2001
Combining Edge, Region, and Shape Information to Segment the Left Ventricle in Cardiac MR Images
M. Jolly
International Conference on Medical Image…
2001
Corpus ID: 43444646
This paper describes a segmentation technique to automatically extract the myocardium in 4D cardiac MR images for quantitative…
Expand
Highly Cited
1999
Highly Cited
1999
Test sequencing algorithms with unreliable tests
V. Raghavan
,
M. Shakeri
,
K. Pattipati
IEEE Trans. Syst. Man Cybern. Part A
1999
Corpus ID: 35416110
In this paper, we consider imperfect test sequencing problems under a single fault assumption. This is a partially observed…
Expand
Highly Cited
1997
Highly Cited
1997
Tolerance analysis for setup planning: A graph theoretical approach
S. Huang
,
Hongchao Zhang
,
W. Oldham
1997
Corpus ID: 62185373
Setup planning is the act of preparing detailed work instructions for setting up a part. The purpose of setting up a part is to…
Expand
1995
1995
Stably supported rotations of a planar polygon with two frictionless contacts
T. Abell
,
M. 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…
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
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