Login / Signup

Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes.

Klaus Truemper
Published in: Math. Oper. Res. (1987)
Keyphrases
  • maximum flow
  • max flow min cut
  • problems in computer vision
  • push relabel
  • directed graph
  • optimization problems
  • graphical models
  • minimum cut