"An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in ..."

José C. Pereira, Fernando G. Lobo (2012)

> Home

Details and statistics

DOI: 10.1007/S11390-012-1272-6

access: closed

type: Journal Article

metadata version: 2017-06-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jcst/PereiraL12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcst/PereiraL12
José C. Pereira, Fernando G. Lobo:
An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case. J. Comput. Sci. Technol. 27(4): 891-896 (2012)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.