Finding nearest neighbours

DOI10.1016/0020-0190(76)90064-8zbMath0338.68036OpenAlexW1980653047MaRDI QIDQ1230653

G. Yuval

Publication date: 1976

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(76)90064-8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Related Items (6)

On Quality Indicators for Black-Box Level Set Approximation ⋮ The average performance analysis of a closest‐pair algorithm ⋮ A probabilistic minimum spanning tree algorithm ⋮ The complexity of finding fixed-radius near neighbors ⋮ A note on the graph isomorphism counting problem ⋮ A note on Rabin's nearest-neighbor algorithm

Cites Work

• Unnamed Item

This page was built for publication: Finding nearest neighbours