LEDA: A Platform for Combinatorial and Geometric Computing
by K. Mehlhorn, St. Näher
Publisher: Cambridge University Press 1999
ISBN/ASIN: 0521563291
ISBN-13: 9780521563291
Number of pages: 1034
Description:
The book treats the architecture, the implementation, and the use of the LEDA system. LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing, written in C++ and freely available worldwide.
Download or read it online for free here:
Download link
(multiple PS files)
Similar books
Vector Models for Data-Parallel Computingby Guy Blelloch - The MIT Press
Vector Models for Data-Parallel Computing describes a model of parallelism that extends and formalizes the Data-Parallel model on which the Connection Machine and other supercomputers are based. It presents many algorithms based on the model.
(11880 views)
Search Algorithms and Applicationsby Nashat Mansour - InTech
This book demonstrates the applicability of search algorithms for the purpose of developing solutions to problems that arise in a variety of domains. It is targeted to a wide group of readers: researchers, graduate students, and practitioners.
(15384 views)
Essentials of Metaheuristicsby Sean Luke
This is an open set of lecture notes on metaheuristics algorithms, intended for undergraduate students, practitioners, programmers, and other non-experts. It was developed as a series of lecture notes for an undergraduate course.
(11339 views)
Purely Functional Data Structuresby Chris Okasaki - Carnegie Mellon University
This book describes data structures from the point of view of functional languages. The author includes both classical data structures, such as red-black trees, and a host of new data structures developed exclusively for functional languages.
(9310 views)