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

AuthID
 P-002-8BN
2
Author(s)
Document Type
Article
Year published
2012
Published
in JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, ISSN: 1000-9000
Volume: 27, Issue: 4, Pages: 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
Marked List
 Add to Marked List
Info
At this moment we don't have any links to full text documens.

A place for researchers and their institutions

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service