Min Cut is NP-Complete for Edge Weigthed Trees.
Burkhard MonienIvan Hal SudboroughPublished in: ICALP (1986)
Keyphrases
- np complete
- min cut
- undirected graph
- weighted graph
- max flow min cut
- graph cuts
- np hard
- graph partitioning
- information theoretic
- energy minimization
- computational complexity
- image segmentation
- pairwise
- constraint satisfaction problems
- global optimization
- energy function
- approximation algorithms
- markov random field
- graph model
- figure ground
- tree structure
- image processing
- directed acyclic graph
- minimum cost
- higher order