A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks (Q6099616): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.4230/lipics.itp.2021.25 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPICS.ITP.2021.25 / rank | |||
Normal rank | |||
Latest revision as of 19:26, 30 December 2024
scientific article; zbMATH DE number 7699442
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks |
scientific article; zbMATH DE number 7699442 |
Statements
20 June 2023
0 references
flow network
0 references
optimization
0 references
infinite graph
0 references
Isabelle/HOL
0 references
A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks (English)
0 references
