An improved, easily computable combinatorial lower bound for weighted graph bipartitioning.
Jesper Larsson TräffMartin WimmerPublished in: CoRR (2014)
Keyphrases
- weighted graph
- lower bound
- graph partitioning
- upper bound
- graph model
- graph structure
- shortest path
- np hard
- optimal solution
- minimum spanning tree
- edge weights
- worst case
- objective function
- graph clustering
- data objects
- adjacency matrix
- minimum weight
- graph connectivity
- spanning tree
- normalized cut
- euclidean distance
- image segmentation
- min cut
- clustering algorithm
- maximum weight
- vertex set
- multimedia