A Local Graph Partitioning Heuristic Meeting Bisection Bounds.

Burkhard Monien Ralf Diekmann

Published in: PPSC (1997)

Keyphrases

graph partitioning
partitioning algorithm
graph model
lower and upper bounds
image segmentation
clustering algorithm
weighted graph
data clustering
lower bound
spectral graph
normalized cut
spectral clustering
superpixels
optimal solution
min cut
data objects
feasible solution