An Optimized Divide-And-Conquer Algorithm for the Closest-Pair Problem in the Planar Case

AuthID
 P-002-8BN
2
Author(s)
Tipo de Documento
Article
Year published
2012
Publicado
in JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, ISSN: 1000-9000
Volume: 27, Número: 4, Páginas: 891-896 (6)
Indexing
Wos®
Scopus®
Crossref®
Google Scholar®
Publication Identifiers
SCOPUS: 2-s2.0-84865369553
Wos: WOS:000306410600020
Source Identifiers
ISSN: 1000-9000
Export Publication Metadata
Lista Marked
 Adicionar à lista Marked
Info
At this moment we don't have any links to full text documens.

Um espaço para investigadores e suas Instituições

Links Úteis

Ajuda

© 2024 CRACS & Inesc TEC - All Rights Reserved Política de Privacidade | Terms of Service