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

Andreas Lochbihler (2021)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ITP.2021.25

access: open

type: Conference or Workshop Paper

metadata version: 2021-06-21

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/itp/Lochbihler21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/itp/Lochbihler21
Andreas Lochbihler:
A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks. ITP 2021: 25:1-25:18

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.