kNN-Borůvka-GPU: A Fast and Scalable MST Construction from kNN Graphs on GPU
- 1 January 2012
- book chapter
- Published by Springer Nature
- p. 71-86
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Clustering Nodes in Large-Scale Biological Networks Using External Memory Algorithms2011
- An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs2009
- Accelerating Large Graph Algorithms on the GPU Using CUDA2008
- A Functional Approach to External Graph Algorithms1998
- An empirical assessment of algorithms for constructing a miminum spanning tree1994
- A parallel algorithm for computing minimum spanning trees1992
- An Indoeuropean Classification: A Lexicostatistical ExperimentTransactions of the American Philosophical Society, 1992
- Minimal spanning trees: An empirical investigation of parallel algorithmsParallel Computing, 1989
- On the History of the Minimum Spanning Tree ProblemIEEE Annals of the History of Computing, 1985
- Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate SpacesIEEE Transactions on Computers, 1978