2 search results - page 1 / 1 » Moments of Inertia and Graph Separators |
SODA
1994
ACM
14 years 11 months ago
1994
ACM
71
Voted
SPAA
1992
ACM
15 years 1 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...