An Algorithmic Approach to Communication Reduction in Parallel Graph Algorithms.
HarshvardhanAdam FidelNancy M. AmatoLawrence RauchwergerPublished in: PACT (2015)
Keyphrases
- graph theory
- learning algorithm
- depth first search
- parallel hardware
- computational complexity
- parallel implementations
- worst case
- optimization problems
- interconnection networks
- minimum spanning tree
- maximum flow
- graph theoretic
- maximum clique
- partitioning algorithm
- planar graphs
- graph structures
- connected components
- shortest path
- significant improvement
- lower bound
- image segmentation