Relation-algebraic verification of Borůvka's minimum spanning tree algorithm (Q2695356): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-030-88701-8_14 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3209152073 / rank | |||
Normal rank | |||
Revision as of 00:53, 20 March 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
