|
|||||
|
|
A fast parallel algorithm for the closest pair problem |
|
| Authors: | Charles R. Dyer |
| Affiliation: | Computer Science Center, University of Maryland, College Park, MD 20742, U.S.A. |
| Abstract: | |
| Keywords: | Parallel computation time complexity space complexity |
| 本文献已被 ScienceDirect 等数据库收录！ | |