Skip to main content
Conference Proceedings

Relation-algebraic derivation of spanning tree algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1998) 1422 23-43
DOI: 10.1007/bfb0054283
11Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We use Tarski’s relational algebra to derive a series of algorithms for computing spanning trees of undirected graphs, including a variant of Prim’s minimum spanning tree algorithm.

Cite

CITATION STYLE

APA

Berghammer, R., von Karger, B., & Wolf, A. (1998). Relation-algebraic derivation of spanning tree algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1422, pp. 23–43). Springer Verlag. https://doi.org/10.1007/bfb0054283

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free