The Visualization of Large Graphs Accelerated by the Parallel Nearest Neighbors Algorithm.
Vojtech UherPetr GajdosVáclav SnáselPublished in: BigMM (2016)
Keyphrases
- parallel implementation
- preprocessing
- objective function
- nearest neighbor
- k means
- dynamic programming
- computational complexity
- worst case
- detection algorithm
- np hard
- data analysis
- search space
- particle swarm optimization
- graph structure
- undirected graph
- graph isomorphism
- learning algorithm
- simulated annealing
- expectation maximization
- segmentation algorithm
- optimal solution
- graph partitioning