Tree Search
Tree Search is a systematic algorithmic method for exploring hierarchical data structures by traversing nodes in a tree, distinguished from other search methods by its recursive navigation from the root through branches to locate a target node or solution.
1.4K
Publications
106K
Citations
3.1K
Authors
1K
Institutions
Publications per year
2017–2026
280
Parents
1.4K
Mastering the game of Go with deep neural networks and tree search
David Silver, Aja Huang, Chris J. Maddison et al. · Nature · 2016 · 15.8K citations
RAxML-NG: a fast, scalable and user-friendly tool for maximum likelihood phylogenetic inference
Alexey M. Kozlov, Diego Darriba, Tomáš Flouri et al. · Bioinformatics · 2019 · 4.5K citations · Full text
An Algorithm for Subgraph Isomorphism
J. R. Ullmann · Journal of the ACM · 1976 · 2.3K citations · Full text
1–5 of 1.4K
3.1K
9
h-index
9
h-index
8
h-index
8
h-index
8
h-index
1–5 of 3.1K
1K
Carnegie Mellon University
Pittsburgh, United States
22 h-index
57 publications
7.4K citations
Tsinghua University
Beijing, China
20 h-index
81 publications
3.2K citations

University of Alberta
Edmonton, Canada
20 h-index
56 publications
2.8K citations

Centre National de la Recherche Scientifique
Paris, France
19 h-index
59 publications
3K citations

Imperial College London
London, United Kingdom
14 h-index
28 publications
13.6K citations
University of Maryland, College Park
College Park, United States
14 h-index
28 publications
1.5K citations
IBM (United States)
Armonk, United States
13 h-index
22 publications
1K citations
University of Michigan
Ann Arbor, United States
12 h-index
21 publications
783 citations
1–8 of 1K
Repository · 37 publications · 1.7K citations
19
h-index
21 publications · 1.8K citations
19
h-index
16 publications · 2.4K citations
16
h-index
16 publications · 1.3K citations
14
h-index
TPAMI · 14 publications · 3.1K citations
13
h-index
1–5