An optimal algorithm to find the degrees of connectedness in an undirected edge-weighted graph.
Saibal BanerjeePublished in: Pattern Recognit. Lett. (1991)
Keyphrases
- weighted graph
- dynamic programming
- optimal solution
- shortest path
- minimum cut
- worst case
- graph structure
- graph model
- graph partitioning
- minimum weight
- similarity measure
- graph clustering
- k means
- clustering method
- np hard
- spanning tree
- segmentation algorithm
- binary images
- graph cuts
- undirected graph
- similarity metric
- edge weights
- vertex set