[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

LEDA: A library of efficient data types and algorithms

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1990)

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

Included in the following conference series:

  • 152 Accesses

Abstract

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

  • •a clear separation of specification and implementation

  • •parameterized data types

  • •its extendibility

  • •its ease of use.

At present, the data types stack, queue, list, set, dictionary, ordered sequence, priority queue, directed and undirected graph and partition are available. Based on these data types a variety of network algorithms (shortest paths, matchings, network flow, planarity testing and embedding, ...) and geometric algorithms (plane sweep, Voronoi digrams, ...) are included.

This research was supported by the ESPRIT II Basic Research Action Program, ESPRIT P. 3075 — ALCOM, and by the DFG, grant SPP Me 620/6-1.

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. K. Mehlhorn and S. Näher: “LEDA, a Library of Efficient Data Types and Algorithms”, MFCS 89, LNCS Vol. 379, 88–106, 1989

    Google Scholar 

  2. S. Näher: “LEDA1.0 User Manual”, Technical Report A 05/89, Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, 1989

    Google Scholar 

  3. S. Näher and K. Mehlhorn: “LEDA, a Library of Efficient Data Types and Algorithms”, Technical Report A 04/89, Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, 1989

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Stefan Näher & Kurt Mehlhorn

Authors
  1. Stefan Näher
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kurt Mehlhorn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael S. Paterson

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Näher, S., Mehlhorn, K. (1990). LEDA: A library of efficient data types and algorithms. In: Paterson, M.S. (eds) Automata, Languages and Programming. ICALP 1990. Lecture Notes in Computer Science, vol 443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032017

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52826-5

  • Online ISBN: 978-3-540-47159-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation