The min-cut and vertex separator problem.
Franz RendlRenata SotirovPublished in: Comput. Optim. Appl. (2018)
Keyphrases
- min cut
- undirected graph
- max flow min cut
- graph cuts
- energy minimization
- information theoretic
- graph partitioning
- pairwise
- directed graph
- energy function
- spanning tree
- markov random field
- directed acyclic graph
- shape prior
- global optimization
- image segmentation
- complex networks
- figure ground
- approximation algorithms
- shape matching
- graph structure
- minimum cost
- mutual information
- clustering algorithm
- perceptual grouping
- lower bound
- dynamic programming
- higher order
- graph model
- convex optimization
- graphical models
- segmentation algorithm
- image processing
- shortest path