Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable.
Laxman DhulipalaGuy E. BlellochJulian ShunPublished in: ACM Trans. Parallel Comput. (2021)
Keyphrases
- computationally efficient
- graph theory
- highly scalable
- computationally expensive
- highly efficient
- parallel architectures
- computationally intensive
- memory efficient
- optimization problems
- single pass
- scale poorly
- significant improvement
- partitioning algorithm
- graph representation
- efficient implementation
- edge weights
- minimum spanning tree
- graph structure
- bipartite graph
- theoretically sound