Login / Signup
A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms.
Yang Dai
Hiroshi Imai
Kazuo Iwano
Naoki Katoh
Keiji Ohtsuka
Nobuhiko Yoshimura
Published in:
Discret. Appl. Math. (1996)
Keyphrases
</>
minimum cut
maximum flow
optimization problems
directed graph
weighted graph
push relabel
approximate solutions
graph partitioning
graph cuts
combinatorial optimization problems
worst case
lower bound
shortest path problem
interior point
min cut
combinatorial optimization
min cut max flow