Efficient Parallel All-Pairs Shortest Paths Algorithm for Complex Graph Analysis.
Jong Wook KimHyoeun ChoiSeung-Hee BaePublished in: ICPP Workshops (2018)
Keyphrases
- learning algorithm
- detection algorithm
- parallel implementation
- single pass
- cost function
- computationally intensive
- dynamic programming
- preprocessing
- graph based algorithm
- optimization algorithm
- high efficiency
- particle swarm optimization
- graph structure
- depth first search
- complexity analysis
- graph model
- shortest path problem
- computationally demanding
- computationally efficient
- solution path
- computational cost
- np hard
- search space
- dominating set
- parallel version
- neural network
- strongly connected components
- matching algorithm
- shortest path
- segmentation algorithm
- random walk
- probabilistic model
- optimal solution
- similarity measure