default search action

combined dblp search
author search
venue search
publication search

ask others

Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID

"Flow Networks and the Min-Cut-Max-Flow Theorem."

Peter Lammich, S. Reza Sefidgar (2017)

> 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/LammichS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/afp/LammichS17
Peter Lammich, S. Reza Sefidgar:
Flow Networks and the Min-Cut-Max-Flow Theorem. Arch. Formal Proofs 2017 (2017)

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.