Login / Signup

The Max-Flow Min-Cut theorem for countable networks.

Ron AharoniEli BergerAgelos GeorgakopoulosAmitai PerlsteinPhilipp Sprüssel
Published in: J. Comb. Theory, Ser. B (2011)
Keyphrases
  • max flow min cut
  • social networks
  • problems in computer vision
  • machine learning
  • multiscale
  • image processing
  • markov chain
  • network structure
  • combinatorial optimization
  • energy minimization
  • min cut