E
dmonds
K
arp_
M
axflow Dependents
2016
A Formal Proof of the Max-Flow Min-Cut Theorem for Countable Networks
by
Andreas Lochbihler
May 09