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
Lecture Notes on Bucket Algorithmsby Luc Devroye - Birkhauser
In these lecture notes, we attempt to explain the connection between the expected time of various bucket algorithms and the distribution of the data. The results are illustrated on standard searching, sorting and selection problems.
(13307 views)
Algorithmsby Robert Sedgewick, Kevin Wayne - Addison-Wesley Professional
This textbook surveys the most important algorithms and data structures in use today. Applications to science, engineering, and industry are a key feature of the text. We motivate each algorithm by examining its impact on specific applications.
(15627 views)
Average Case Analysis of Algorithms on Sequencesby Wojciech Szpankowski - Wiley-Interscience
A book on a topic that has witnessed a surge of interest over the last decade, owing in part to several novel applications in data compression and computational molecular biology. It describes methods employed in average case analysis of algorithms.
(14450 views)
Algorithms for Clustering Databy Anil K. Jain, Richard C. Dubes - Prentice Hall
The book is useful for scientists who gather data and seek tools for analyzing and interpreting data. It will be a reference for scientists in a variety of disciplines and can serve as a textbook for a graduate course in exploratory data analysis.
(23607 views)