Fast and memory-efficient minimum spanning tree on the GPU.
Scott RostrupShweta SrivastavaKishore SinghalPublished in: Int. J. Comput. Sci. Eng. (2013)
Keyphrases
- memory efficient
- minimum spanning tree
- spanning tree
- graph theory
- external memory
- shortest path
- steiner tree
- graphics processing units
- parallel computing
- parallel implementation
- traveling salesman problem
- minimum weight
- weighted graph
- ant colony optimization
- iterative deepening
- parallel computation
- edge weights
- integral image
- computer vision