Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable.
Laxman DhulipalaGuy E. BlellochJulian ShunPublished in: SPAA (2018)
Keyphrases
- highly scalable
- computationally efficient
- computationally expensive
- highly efficient
- parallel architectures
- learning algorithm
- memory efficient
- graph theory
- scale poorly
- theoretically sound
- complexity analysis
- computationally intensive
- structured data
- single pass
- optimization problems
- computational cost
- depth first search
- significant improvement
- data structure
- weighted graph
- efficient implementation
- parallel implementation
- theoretical analysis
- minimum spanning tree
- pruning strategy
- computational complexity
- parallel hardware