Skip to main content
SpringerLink
Log in

Relation-algebraic derivation of spanning tree algorithms

  • Conference paper
  • First Online:
Mathematics of Program Construction (MPC 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1422))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berghammer R., Schmidt G.: RELVIEW — A computer system for the manipulation of relations. In: Nivat M., et al. (eds.): Proc. AMAST '93, Workshops in Computing, Springer Verlag, 405–406 (1993)

    Google Scholar 

  2. Berghammer R., von Karger B., Ulke C.: Relation-algebraic analysis of Petri nets with RELVIEW. In: Margaria T., Steffen B. (eds.): Proc. TACAS '96, LNCS 1055, Springer Verlag, 49–69 (1996)

    Google Scholar 

  3. Hattensperger, C.: Computer-aided proofs in relational algebras (in German). Dissertation, Faculty of Computer Science, University of German Forces Munich (1997)

    Google Scholar 

  4. Brink C., Kahl W., Schmidt G. (eds.): Relational methods in computer science. Advances in Computing Science, Springer Verlag (1997)

    Google Scholar 

  5. Dijkstra E.W.: A discipline of programming. Prentice-Hall (1976)

    Google Scholar 

  6. Gries D.: The science of computer programming. Springer Verlag (1981)

    Google Scholar 

  7. Jungnickel D.: Graphen, Netzwerke und Algorithmen. BI Wissenschaftsverlag, 3rd ed. (1994)

    Google Scholar 

  8. Kruskal J.B.: On the shortest spanning subtree of a graph and the travelling salesman problem. Proc. AMS 7, 48–50 (1956)

    Article  MATH  MathSciNet  Google Scholar 

  9. Morgan C., Vickers T. (eds.): On the refinement calculus. Springer Verlag (1994)

    Google Scholar 

  10. Prim R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36, 1389–1401 (1957)

    Google Scholar 

  11. Schmidt G., Ströhlein T.: Relations and graphs. Discrete Mathematics for Computer Scientists, EATCS Monographs on Theoretical Computer Science, Springer Verlag (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Preusserstraße 1-9, D-24105, Kiel, Germany

    Rudolf Berghammer, Burghard von Karger & Andreas Wolf

Authors
  1. Rudolf Berghammer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Burghard von Karger
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andreas Wolf
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Johan Jeuring

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berghammer, R., von Karger, B., Wolf, A. (1998). Relation-algebraic derivation of spanning tree algorithms. In: Jeuring, J. (eds) Mathematics of Program Construction. MPC 1998. Lecture Notes in Computer Science, vol 1422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054283

Download citation

  • DOI: https://doi.org/10.1007/BFb0054283

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64591-7

  • Online ISBN: 978-3-540-69345-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation