scientific article; zbMATH DE number 7051199

MaRDI QIDQ4633839zbMATH OpenFDO

Authors Yury Lifshits, Shengyu Zhang

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496806

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

Recommendations

• Decomposable algorithms for nearest neighbor computing
• On nearest-neighbor graphs
• On nearest-neighbor graphs
• Small components in \(k\)-nearest neighbour graphs
• The complexity of finding fixed-radius near neighbors
• scientific article; zbMATH DE number 437556
• Algorithmic Aspects of Neighborhood Numbers
• Maximal clique enumeration in finding near neighbourhoods
• NEAREST NEIGHBOR PROBLEMS

Cited in

(1)

• Distance-based index structures for fast similarity search

This page was built for publication:

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