A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory (Q2102926)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7632086
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory |
scientific article; zbMATH DE number 7632086 |
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
0 references
0.806340217590332
0 references
0.7628652453422546
0 references
0.759002149105072
0 references
0.7523173093795776
0 references
0.7379997372627258
0 references
