Login / Signup
Odd minimum cut sets and b-matchings revisited.
Adam N. Letchford
Dirk Oliver Theis
Published in:
CoRR (2006)
Keyphrases
</>
minimum cut
maximum flow
graph cuts
weighted graph
evolutionary algorithm
graph partitioning
shortest path problem
push relabel
shortest path
maximum cardinality
min cut max flow
directed graph
superpixels
min cut