Skip to main content
SpringerLink
Log in

LEDA a library of efficient data types and algorithms

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1989 (MFCS 1989)

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

Abstract

LEDA is a library of efficient data types and algorithms. At present, its strength is graph algorithms and the data structures related to them. The computational geometry part is evolving. The main features of the library are

  1. 1)

    a clear separation of specification and implementation

  2. 2)

    parameterized data types

  3. 3)

    a comfortable data type graph, and

  4. 4)

    its ease of use.

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.

VIII. References

  1. R.K. Ahuja, K. Mehlhorn, J.B. Orlin, R.E. Tarjan: “Faster Algorithms for the Shortest Path Problem”, Technical Report No. 193, MIT, Cambridge, 1988

    Google Scholar 

  2. A.V. Aho, J.E. Hopcroft, J.D. Ullman: “Data Structures and Algorithms”, Addison-Wesley Publishing Company, 1983

    Google Scholar 

  3. A. Bachem: Personal Communication, 1988

    Google Scholar 

  4. A. Müller-von Brochowski, T. Kretschmer, J. Messerschmitt, M. Ries, J. Schütz: “The Programming Language Comskee”, Linguistische Arbeiten, Heft 10, SFB 100, Univ. des Saarlandes, Saarbrücken, 1984

    Google Scholar 

  5. M.L. Fredman, and R.E. Tarjan: “Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms”, 25th Annual IEEE Symp. on Found. of Comp. Sci., 338–346, 1984

    Google Scholar 

  6. C. Lins: “The Modula-2 Software Component Library”, Springer Publishing Company, 1989

    Google Scholar 

  7. K. Mehlhorn: “Data Structures and Algorithms”, Vol. 1–3, Springer Publishing Company, 1984

    Google Scholar 

  8. J. Soukup: “Organized C”, Typescript, 1988

    Google Scholar 

  9. B. Stroustrup: “The C++ Programming Language”, Addison-Wesley Publishing Company, 1986

    Google Scholar 

  10. R.E. Tarjan: “Data Structures and Network Algorithms”, CBMS-NSF Regional Conference Series in Applied Mathematics, Vol. 44, 1983

    Google Scholar 

  11. P. Thomas, H. Robinson, J.Emms: “Abstract Data Types”, Oxford Applied Mathematics and Computing Science Series, 1988

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität des Saarlandes, D-6600, Saarbrücken, Federal Republic of Germany

    Kurt Mehlhorn & Stefan Näher

Authors
  1. Kurt Mehlhorn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Näher
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Antoni Kreczmar Grazyna Mirkowska

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mehlhorn, K., Näher, S. (1989). LEDA a library of efficient data types and algorithms. In: Kreczmar, A., Mirkowska, G. (eds) Mathematical Foundations of Computer Science 1989. MFCS 1989. Lecture Notes in Computer Science, vol 379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51486-4_58

Download citation

  • DOI: https://doi.org/10.1007/3-540-51486-4_58

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51486-2

  • Online ISBN: 978-3-540-48176-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation