"A Formal Proof of the Max-Flow Min-Cut Theorem for Countable Networks."

Andreas Lochbihler (2016)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2020-05-25

- view
  - electronic edition @ isa-afp.org (open access)
- export record
  dblp key:
  - journals/afp/Lochbihler16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/afp/Lochbihler16
Andreas Lochbihler:
A Formal Proof of the Max-Flow Min-Cut Theorem for Countable Networks. Arch. Formal Proofs 2016 (2016)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.