Finding nearest neighbours

DOI10.1016/0020-0190(76)90064-8MaRDI QIDQ1230653zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(6)

• 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
• The average performance analysis of a closest‐pair algorithm
• On quality indicators for black-box level set approximation

This page was built for publication: Finding nearest neighbours

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1230653)