Skip to content
Register Sign in Wishlist
Look Inside LEDA

LEDA
A Platform for Combinatorial and Geometric Computing
2 Part Paperback Set

CAD$135.95 (P)

  • Date Published: June 2009
  • availability: Available
  • format: Multiple copy pack
  • isbn: 9780521109413

CAD$ 135.95 (P)
Multiple copy pack

Add to cart Add to wishlist

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • In the core computer science areas--data structures, graph and network algorithms, and computational geometry--LEDA is the first library to cover all material found in the standard textbooks. Written in C++ and freely available worldwide on a variety of hardware, the software is installed at hundreds of sites. This book, written by the main authors of LEDA, is the definitive account of how the system operates and how it can be used. The authors supply plentiful examples from a range of areas to show practical uses of the library, making the book essential for all researchers in algorithms, data structures and computational geometry.

    • Definitive book on the only software library for geometric computing
    • Written by authors of the library
    • Covers the details of the library plus its use through examples
    Read more

    Reviews & endorsements

    "LEDA presents a different sort of library, namely, one that supports the type of programming that is the basis of our standard algorithm and data structures courses... LEDA, the book, complements LEDA, the library... I find it both highly commendable and also somewhat mind-boggling that well-known researchers will take time to contribute in substantialways to the practice: commendable, because such work contributes to the vitality and progress of the practical side of our discipline, while simultaneously validating the need for fundamental research; and mind-boggling because I can only imagine the investment of time such a project requires. A measure of LEDA'S success can ben found in its use. At the time the book was written over 1500 institutions had intalled LEDA on local systems... And so, my hat is off to Kurt Mehlhorn and Stefan Naher for their fine contribution to our discipline." SIGACT News

    "...a comprehensive treatment of the system and its use." Mathematical Reviews

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: June 2009
    • format: Multiple copy pack
    • isbn: 9780521109413
    • dimensions: 252 x 324 x 68 mm
    • weight: 2.22kg
    • contains: 120 b/w illus.
    • availability: Available
  • Table of Contents

    Preface
    1. Introduction
    2. Foundations
    3. Basic data types
    4. Numbers and matrices
    5. Advanced data types
    6. Graphs and their data structures
    7. Graph algorithms
    8. Embedded graphs
    9. The geometry kernels
    10. Geometry algorithms
    11. Windows and panels
    12. GraphWin
    13. On the implementation of LEDA
    14. Manual pages and documentation
    Bibliography
    Index.

  • Authors

    Kurt Mehlhorn, Max-Planck-Institut für Informatik, Saarbruecken

    Stefan Näher, Universität Trier, Germany

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×