A Weighted Inverse Minimum Cut Problem under the Bottleneck Type Hamming Distance.

Longcheng Liu Enyu Yao

Published in: Asia Pac. J. Oper. Res. (2007)

Keyphrases

hamming distance
minimum cut
weighted graph
maximum flow
pattern matching
binary strings
distance measure
graph cuts
binary codes
graph partitioning
shortest path problem
dynamic programming
medical images
shortest path
hash functions