Advertisement

LEDA a library of efficient data types and algorithms

  • Kurt Mehlhorn
  • Stefan Näher
Invited Lectures
Part of the Lecture Notes in Computer Science book series (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.

     

Keywords

Data Type Priority Queue Graph Algorithm Minimum Span Tree Problem Abstract Data Type 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

VIII. References

  1. [AMOT88]
    R.K. Ahuja, K. Mehlhorn, J.B. Orlin, R.E. Tarjan: “Faster Algorithms for the Shortest Path Problem”, Technical Report No. 193, MIT, Cambridge, 1988Google Scholar
  2. [AHU83]
    A.V. Aho, J.E. Hopcroft, J.D. Ullman: “Data Structures and Algorithms”, Addison-Wesley Publishing Company, 1983Google Scholar
  3. [B88]
    A. Bachem: Personal Communication, 1988Google Scholar
  4. [BKMRS84]
    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, 1984Google Scholar
  5. [FT84]
    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, 1984Google Scholar
  6. [L89]
    C. Lins: “The Modula-2 Software Component Library”, Springer Publishing Company, 1989Google Scholar
  7. [M84]
    K. Mehlhorn: “Data Structures and Algorithms”, Vol. 1–3, Springer Publishing Company, 1984Google Scholar
  8. [So89]
    J. Soukup: “Organized C”, Typescript, 1988Google Scholar
  9. [St86]
    B. Stroustrup: “The C++ Programming Language”, Addison-Wesley Publishing Company, 1986Google Scholar
  10. [T83]
    R.E. Tarjan: “Data Structures and Network Algorithms”, CBMS-NSF Regional Conference Series in Applied Mathematics, Vol. 44, 1983Google Scholar
  11. [TRE88]
    P. Thomas, H. Robinson, J.Emms: “Abstract Data Types”, Oxford Applied Mathematics and Computing Science Series, 1988Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Kurt Mehlhorn
    • 1
  • Stefan Näher
    • 1
  1. 1.Fachbereich InformatikUniversität des SaarlandesSaarbrückenFederal Republic of Germany

Personalised recommendations