Skip to main content

LEDA: a Library of Efficient Algorithms

1995; Mehlhorn, Näher

  • Reference work entry
Encyclopedia of Algorithms
  • 212 Accesses

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 399.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Algorithmic Solutions Software GmbH, http://www.algorithmic-solutions.com/. Accessed February 2008

  2. Boost C++ Libraries, http://www.boost.org/. Accessed February 2008

  3. CGAL: Computational Geometry Algorithms Library, http://www.cgal.org/. Accessed February 2008

  4. Mehlhorn, K., Näher, S.: LEDA: A Platform for Combinatorial and Geometric Computing. Commun. ACM. 38(1), 96–102 (1995)

    Article  Google Scholar 

  5. Mehlhorn, K., Näher, S.. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Boston (1999)

    MATH  Google Scholar 

  6. Siek, J., Lee, L.Q., Lumsdaine, A.: The Boost Graph Library. Addison-Wesley, Cambridge (2002)

    Google Scholar 

  7. Stepanov, A., Lee, M.: The Standard Template Library. In: Technical Report X3J16/94–0095, WG21/N0482, ISO Programming Language C++ Project. Hewlett-Packard, Palo Alto CA (1994)

    Google Scholar 

  8. The Stony Brook Algorithm Repository, http://www.cs.sunysb.edu/~algorith/. Accessed February 2008

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Zaroliagis, C. (2008). LEDA: a Library of Efficient Algorithms. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_200

Download citation

Publish with us

Policies and ethics