Efficient k-nearest neighbors search in graph space
Research article (Pattern Recognition Letters, 2018) · cited 30× · AI/ML
Press Enter · cited answer in seconds
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Direct Wikidata claims
- [2] ↑ Efficient k-nearest neighbors search in graph space — instance of (P31): scholarly article. wikidata.org.
Class ancestry
📑 Cite this page
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA
4ort.xyz Knowledge Graph. (2026). Efficient k-nearest neighbors search in graph space. Retrieved May 24, 2026, from https://4ort.xyz/entity/efficient-k-nearest-neighbors-search-in-graph-space
MLA
“Efficient k-nearest neighbors search in graph space.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/efficient-k-nearest-neighbors-search-in-graph-space.
BibTeX
@misc{4ortxyz_efficient-k-nearest-neighbors-search-in-graph-space_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Efficient k-nearest neighbors search in graph space}}, year = {2026}, url = {https://4ort.xyz/entity/efficient-k-nearest-neighbors-search-in-graph-space}, note = {Accessed: 2026-05-24}}
LLM prompt
According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Efficient k-nearest neighbors search in graph space — https://4ort.xyz/entity/efficient-k-nearest-neighbors-search-in-graph-space (retrieved 2026-05-24)
Canonical URL: https://4ort.xyz/entity/efficient-k-nearest-neighbors-search-in-graph-space · Last refreshed: