Nearest Neighbor Graphs
Nearest Neighbor Graphs is a data structure in which each node represents a data point and directed edges connect each node to its closest counterparts based on a distance metric, enabling efficient approximation of nearest neighbor queries in high-dimensional spaces.
463
Publications
32.4K
Citations
1.1K
Authors
489
Institutions
Publications per year
2017–2026
104
Variants
Nng
Parents
463
Piotr Indyk, Rajeev Motwani · 1998 · 4.2K citations · Full text
History of the Lenz-Ising Model
Stephen G. Brush · Reviews of Modern Physics · 1967 · 736 citations
Natural Sciences, Chemistry, Physics +13
1–5 of 463
1.1K
9
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 1.1K
489
University of Illinois Urbana-Champaign
Urbana, United States
9 h-index
15 publications
1.1K citations
Stanford University
Stanford, United States
9 h-index
13 publications
9K citations
Carnegie Mellon University
Pittsburgh, United States
9 h-index
15 publications
901 citations

University of Minnesota
Minneapolis, United States
7 h-index
16 publications
612 citations

Zhejiang University
Hangzhou, China
7 h-index
22 publications
1.6K citations
University of Michigan
Ann Arbor, United States
7 h-index
15 publications
959 citations
University of Southern California
Los Angeles, United States
6 h-index
13 publications
644 citations
Georgia Institute of Technology
Atlanta, United States
6 h-index
21 publications
687 citations
1–8 of 489
Repository · 18 publications · 637 citations
15
h-index
11 publications · 376 citations
10
h-index
PRB · 9 publications · 208 citations
9
h-index
PRE · 7 publications · 199 citations
7
h-index
PRL · 6 publications · 467 citations
6
h-index
1–5