Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable.
Laxman DhulipalaGuy E. BlellochJulian ShunPublished in: CoRR (2018)
Keyphrases
- highly scalable
- parallel architectures
- graph theory
- computationally expensive
- computationally efficient
- efficient implementation
- depth first search
- computationally intensive
- parallel processing
- theoretical analysis
- optimization problems
- significant improvement
- computational complexity
- edge weights
- single pass
- learning algorithm
- memory efficient
- graph matching
- graph model
- limited memory
- parallel implementations
- parallel hardware
- random graphs
- graph representation
- highly efficient
- data structure