Login / Signup
Computing finest mincut partitions of a graph and application to routing problems.
Gerhard Reinelt
Dirk Oliver Theis
Klaus Michael Wenger
Published in:
Discret. Appl. Math. (2008)
Keyphrases
</>
routing problem
min cut
max flow
weighted graph
depth first search
global optimization
image segmentation
wireless sensor networks
undirected graph
graph partitioning