scientific article; zbMATH DE number 1210360

zbMath0905.68020MaRDI QIDQ4213376

Andreas Wolf, Rudolf Berghammer, Burghard von Karger

Publication date: 9 December 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph algorithmsrelational methodsspanning trees program development

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) General topics in the theory of software (68N01) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items (7)

Stone Relation Algebras ⋮ Relation-Algebraic Verification of Prim’s Minimum Spanning Tree Algorithm ⋮ Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras ⋮ Relation-algebraic verification of Borůvka's minimum spanning tree algorithm ⋮ Combining relational calculus and the Dijkstra-Gries method for deriving relational programs ⋮ Verifying minimum spanning tree algorithms with Stone relation algebras ⋮ An algebraic framework for minimum spanning tree problems

Uses Software

• RelView

This page was built for publication: