A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory (Q2102926): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:45, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory |
scientific article |
Statements
A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory (English)
0 references
12 December 2022
0 references
flow network
0 references
optimization
0 references
infinite graph
0 references
Isabelle/HOL
0 references
probability
0 references
