A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks (Q6099616): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2021/13920/pdf/LIPIcs-ITP-2021-25.pdf/ / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3175141525 / rank | |||
Normal rank | |||
| Property / title | |||
A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks (English) | |||
| Property / title: A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks (English) / rank | |||
Normal rank | |||
Revision as of 09:03, 30 July 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
