Skip to search formSkip to main contentSkip to account menu

Depth-first search

Known as: Forward edge, DFS, Depth first search 
Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Alpha–beta pruningAnalysis of algorithmsBacktrackingBeam stack search

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
A Proposed Test Case Generation Technique Based on Activity Diagrams
— Software testing is an essential and integral part of the software development process. The testing effort is divided into… 
Highly Cited
2011
Highly Cited
2011
Multi-Core LTSmin: Marrying Modularity and Scalability
The LTSMIN toolset provides multiple generation and on-the-fly analysis algorithms for large graphs (state spaces), typically… 
Highly Cited
2010
Highly Cited
2010
The train driver recovery problem - A set partitioning based model and solution method
2009
2009
Synchronizer Behavior and Analysis
Synchronizer characterization is non-trivial. The exponential response to parameter changes makes this task a challenge, which is… 
Highly Cited
2008
Highly Cited
2008
Integrated predictive control and scheduling co-design for networked control systems
A predictive control and scheduling co-design approach is proposed to deal with the controller and scheduler design for a set of… 
Highly Cited
2006
Highly Cited
2006
Mining Shifting-and-Scaling Co-Regulation Patterns on Gene Expression Profiles
In this paper, we propose a new model for coherent clustering of gene expression data called reg-cluster. The proposed model… 
Highly Cited
2006
Highly Cited
2006
Clustering graphs by weighted substructure mining
Graph data is getting increasingly popular in, e.g., bioinformatics and text processing. A main difficulty of graph data… 
2002
2002
Selective depth-first game-tree search
This thesis continues an ongoing study of algorithms for selective depth-first expansion of game trees (for two-person zero-sum… 
2001
2001
A study of the impact of student background and preparedness on outcomes in CS I
A study that assesses the significance of student background characteristics on outcomes in a depth-first CS I course is… 
1993
1993
Halting Problem of One Binary Horn Clause is Undecidable
This paper proposes a codification of the halting problem of any Turing machine in the form of only one right-linear binary Horn… 
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)