A Faster Algorithm for Finding the Minimum Cut in a Graph.
Jianxiu HaoJames B. OrlinPublished in: SODA (1992)
Keyphrases
- minimum cut
- maximum flow
- weighted graph
- graph structure
- shortest path problem
- graph cuts
- objective function
- optimal solution
- dynamic programming
- np hard
- graph partitioning
- min cut max flow
- max flow
- k means
- bipartite graph
- spanning tree
- data clustering
- matching algorithm
- energy function
- markov random field
- similarity measure