Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning Tree.
Rajesh JayaramVahab MirrokniShyam NarayananPeilin ZhongPublished in: CoRR (2023)
Keyphrases
- parallel algorithm
- minimum spanning tree
- high dimensional
- spanning tree
- graph theory
- low dimensional
- parallel computation
- shared memory
- similarity search
- steiner tree
- euclidean space
- dimensionality reduction
- traveling salesman problem
- parallel computing
- metric space
- parallel implementations
- parallel programming
- pc cluster
- feature space
- euclidean distance
- ant colony optimization
- high dimensional data
- data points
- weighted graph
- manifold learning
- massively parallel
- shortest path
- neighborhood structure
- parallel version
- query processing
- search space
- genetic algorithm