A Faster Algorithm for Finding the Minimum Cut in a Directed Graph.
Jianxiu HaoJames B. OrlinPublished in: J. Algorithms (1994)
Keyphrases
- maximum flow
- directed graph
- minimum cut
- shortest path problem
- graph structure
- k means
- dynamic programming
- worst case
- graph cuts
- lower bound
- strongly connected
- higher order
- clustering method
- convergence rate
- segmentation algorithm
- graph model
- convex optimization
- ant colony optimization
- clustering algorithm
- random walk
- particle swarm optimization
- probabilistic model
- objective function