Formalizing network flow algorithms: a refinement approach in Isabelle/HOL (Q1722647)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Formalizing network flow algorithms: a refinement approach in Isabelle/HOL |
scientific article; zbMATH DE number 7024459
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Formalizing network flow algorithms: a refinement approach in Isabelle/HOL |
scientific article; zbMATH DE number 7024459 |
Statements
Formalizing network flow algorithms: a refinement approach in Isabelle/HOL (English)
0 references
18 February 2019
0 references
maximum flow problem
0 references
Edmonds-Karp algorithm
0 references
push-relabel algorithm
0 references
formal verification
0 references
Isabelle/HOL
0 references
stepwise refinement
0 references
0 references
0.86172485
0 references
0.84972525
0 references
0 references
0.8448649
0 references
0.84450775
0 references
