A new diffusion-based multilevel algorithm for computing graph partitions of very high quality.
Henning MeyerhenkeBurkhard MonienThomas SauerwaldPublished in: IPDPS (2008)
Keyphrases
- k means
- high quality
- computational complexity
- learning algorithm
- graph structure
- optimization algorithm
- maximum flow
- objective function
- significant improvement
- simulated annealing
- computational cost
- shortest path problem
- segmentation algorithm
- genetic algorithm
- dynamic programming
- cost function
- preprocessing
- similarity measure
- matching algorithm
- directed graph
- graph partitioning
- minimum spanning tree
- clustering algorithm
- polynomial time complexity
- dominating set