Communication Avoiding All-Pairs Shortest Paths Algorithm for Sparse Graphs.
Lin ZhuQiang-Sheng HuaHai JinPublished in: ICPP (2021)
Keyphrases
- experimental evaluation
- dynamic programming
- objective function
- computational complexity
- learning algorithm
- computational cost
- times faster
- worst case
- matching algorithm
- optimization algorithm
- high accuracy
- cost function
- significant improvement
- np hard
- detection algorithm
- undirected graph
- optimal solution
- preprocessing
- k means
- expectation maximization
- simulated annealing
- search space
- clustering method
- tree structure
- search algorithm
- recognition algorithm
- spanning tree
- probabilistic model
- minimum spanning tree
- graph isomorphism