Relation-algebraic verification of Borůvka's minimum spanning tree algorithm (Q2695356): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Archive Formal Proofs / rank | |||
Normal rank | |||
Revision as of 16:14, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relation-algebraic verification of Borůvka's minimum spanning tree algorithm |
scientific article |
Statements
Relation-algebraic verification of Borůvka's minimum spanning tree algorithm (English)
0 references
30 March 2023
0 references
algorithm verification
0 references
formal methods
0 references
Kleene algebras
0 references
relation algebras
0 references
stone algebras
0 references
weighted graphs
0 references
