Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,147,103 papers from all fields of science
Search
Sign In
Create Free Account
Depth-first search
Known as:
Forward edge
, DFS
, Depth first search
Expand
Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Alpha–beta pruning
Analysis of algorithms
Backtracking
Beam stack search
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Joint Learning of POS and Dependencies for Multilingual Universal Dependency Parsing
Z. Li
,
Shexia He
,
Zhuosheng Zhang
,
Zhao Hai
Conference on Computational Natural Language…
2018
Corpus ID: 53106242
This paper describes the system of team LeisureX in the CoNLL 2018 Shared Task: Multilingual Parsing from Raw Text to Universal…
Expand
2010
2010
Towards a Pattern-Based Framework for Goal-Driven Business Process Modeling
S. Behnam
,
Daniel Amyot
,
G. Mussbacher
Eighth ACIS International Conference on Software…
2010
Corpus ID: 15105705
In organizations, a gap commonly exists between business goals and business processes. While several approaches provide modeling…
Expand
2007
2007
Interference-Free TDMA Slot Allocation in Wireless Sensor Networks
M. Nunes
,
A. Grilo
,
M. Macedo
IEEE Conference on Local Computer Networks
2007
Corpus ID: 16483622
This paper presents a distributed algorithm for efficient Time Division Multiple Access (TDMA) slot allocation in Wireless Sensor…
Expand
Review
2003
Review
2003
A Survey and Performance Evaluation of Scalable Tree-based Application Layer Multicast Protocols
Su-Wei Tan
,
A. Waters
,
J. Crawford
2003
Corpus ID: 13925385
Application layer multicast (ALM) enables rapid deployment of multicast applications in the Internet. In ALM, application hosts…
Expand
2003
2003
Tongue Body constriction differences in click types
Amanda L. Miller
,
L. Namaseb
,
Khalil Iskarous
2003
Corpus ID: 17355165
We investigate the articulatory bases of the Back Vowel Constraint (BVC), where post-alveolar clicks pattern with uvulars and…
Expand
2002
2002
A BRANCH-AND-BOUND METHOD FOR FINDING FLOW-PATH DESIGNING OF AGV SYSTEMS
R. Zanjirani
,
F. Ghasemi-Tari
2002
Corpus ID: 14743405
One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents…
Expand
1996
1996
Dynamic scheduling strategies for shared-memory multiprocessors
B. Hamidzadeh
,
D. Lilja
Proceedings of 16th International Conference on…
1996
Corpus ID: 1013392
Efficiently scheduling parallel tasks on to the processors of a shared-memory multiprocessor is critical to achieving high…
Expand
1994
1994
Use of a Real-Valued Local Minimum in Parallel Interval Global Optimization
O. Caprani
,
Brian Godthaab
,
K. Madsen
1994
Corpus ID: 18508689
We consider a parallel method for finding the global minimum (and all of the global minimizers) of a continuous non-linear…
Expand
1990
1990
The Local Organization of Text
Penelope Sibun
International Conference on Natural Language…
1990
Corpus ID: 14316775
In this paper, I present a model of the local organization of extended text. I show that texts with weak rhetorical structure and…
Expand
1984
1984
Computationally Optimal Metric-First Code Tree Search Algorithms
Shiwali Mohan
,
John B. Anderson
IEEE Transactions on Communications
1984
Corpus ID: 38959136
Code tree search algorithms find wide applicability in source encoding, channel decoding, pattern recognition, and maximum…
Expand