LEDA: A Platform for Combinatorial and Geometric Computing [Hardcover]

Kurt Mehlhorn (Author), Stefan Näher (Author)

Book Description

ISBN-10: 0521563291 | ISBN-13: 978-0521563291 | Publication Date: November 28, 1999

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.

Editorial Reviews

Review

"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

Book Description

LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing. In each of the core areas of data structures, graph and network algorithms, and computational geometry, LEDA covers all (and more) that is found in the standard textbooks. LEDA is the first such library and this is the first book devoted to it. Written by the main authors of LEDA it is the definitive account, making the book essential for all workers in algorithms, data structures and computational geometry.

Product Details

• Hardcover: 1034 pages
• Publisher: Cambridge University Press (November 28, 1999)
• Language: English
• ISBN-10: 0521563291
• ISBN-13: 978-0521563291
• Product Dimensions: 10 x 8 x 2.2 inches
• Shipping Weight: 4.3 pounds
• Average Customer Review: 5.0 out of 5 stars  See all reviews (2 customer reviews)
• Amazon Best Sellers Rank: #3,131,267 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

8 of 10 people found the following review helpful:

5.0 out of 5 stars Essential for those who are interested in LEDA, April 27, 2000

By 

Young Jun Kim (West Lafayette, IN) - See all my reviews

This review is from: LEDA: A Platform for Combinatorial and Geometric Computing (Hardcover)

LEDA library is one of the best library ever built to combine efficient data structures with extensive algorithms, ( ). Particularly the readability of the code is one of the best. This book is essential for those who want to know more about LEDA and the theory behind it. From the point of view of a computational geometer, the book shows a nice and detailed presentation of the theory and its implementation in practice. Especially I like the pseudo code part in the book.

5 of 6 people found the following review helpful:

5.0 out of 5 stars A must-read for every serious scientific programmer, July 30, 2002

By 

"quadruplex" - See all my reviews

This review is from: LEDA: A Platform for Combinatorial and Geometric Computing (Hardcover)

I've never read a book like this before. It teaches you very complex
algorithms *and* how to prove their correctness *and* their concrete
implementation in C++ *and* how to prove the correctness of the given
implementation *and* how to speed up the implementation *and* the
proper use of the fantastic LEDA-library *and* the underlying object
oriented design *and* how to do fine software engineering.

I've really read every single line of this book, even every single
line of code and I'm filled with enthusiasm. It is definitely a
must-read for every scientific programmer who wishes to improve his
style of programming, the correctness and speed of his code, his time
spent for coding, or who just wants to learn about the most important data
structures and their implementation and how to borrow them from the
award winning LEDA library instead of inventing the wheel twice.

This book finishes the time of boring pseudocode lyricists who teach
you how and why an algorithm and his data structures work, but not how
you can *get* them to work.