LEDA: A Platform for Combinatorial and Geometric Computing

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.

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.

    Title LEDA: A Platform for Combinatorial and Geometric Computing
    Author(s) K. Mehlhorn, St. Näher
    Publisher: Cambridge University Press (November 28, 1999)
    Hardcover 1034 pages
    Language: English
    ISBN-10: 0521563291
    ISBN-13: 978-0521563291

    eBook: http://www.mpi-inf.mpg.de/~mehlhorn/LEDAbook.html