| Home |
| About |
| Submission |
| Updating Entries |
| Using Entries |
| Search |
| Statistics |
| Index |
| Download |
Relational Minimum Spanning Tree Algorithms
| Title: | Relational Minimum Spanning Tree Algorithms |
| Authors: | Walter Guttmann and Nicolas Robinson-O'Brien |
| Submission date: | 2020-12-08 |
| Abstract: | We verify the correctness of Prim's, Kruskal's and Borůvka's minimum spanning tree algorithms based on algebras for aggregation and minimisation. |
| BibTeX: |
@article{Relational_Minimum_Spanning_Trees-AFP,
author = {Walter Guttmann and Nicolas Robinson-O'Brien},
title = {Relational Minimum Spanning Tree Algorithms},
journal = {Archive of Formal Proofs},
month = dec,
year = 2020,
note = {\url{https://isa-afp.org/entries/Relational_Minimum_Spanning_Trees.html},
Formal proof development},
ISSN = {2150-914x},
}
|
| License: | BSD License |
| Depends on: | Aggregation_Algebras, Relational_Disjoint_Set_Forests |
| Status: [ok] | This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations. |
|
Proof outline Proof document |
| Browse theories |
| Download this entry |