SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM

Abstract

Citation

[LS95] Lenhof, H.-P., & Smid, M. (1995). Sequential and parallel algorithms for the k closest pairs problem. Int. J. Comput. Geometry Appl., 5(3), 273-288.
Read Publication