Relation-algebraic verification of Borůvka's minimum spanning tree algorithm
From MaRDI portal
Publication:2695356
DOI10.1007/978-3-030-88701-8_14OpenAlexW3209152073MaRDI QIDQ2695356
Nicolas Robinson-O'Brien, Walter Guttmann
Publication date: 30 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-88701-8_14
Uses Software
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Relation algebras
- An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
- Winskel is (almost) right: Towards a mechanized semantics textbook
- A completeness theorem for Kleene algebras and the algebra of regular events
- Isabelle/HOL. A proof assistant for higher-order logic
- A relation-algebraic view on evolutionary algorithms for some graph problems
- An algebraic framework for minimum spanning tree problems
- Verifying minimum spanning tree algorithms with Stone relation algebras
- Computing tournament solutions using relation algebra and RelView
- Relation-Algebraic Verification of Prim’s Minimum Spanning Tree Algorithm
- A randomized linear-time algorithm to find minimum spanning trees
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- On the History of the Minimum Spanning Tree Problem
- Sur la liaison et la division des points d'un ensemble fini
- Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Relation-algebraic verification of Borůvka's minimum spanning tree algorithm
