Logo

LEDA: A Platform for Combinatorial and Geometric Computing

Large book cover: LEDA: A Platform for Combinatorial and Geometric Computing

LEDA: A Platform for Combinatorial and Geometric Computing
by

Publisher: Cambridge University Press
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.

Home page url

Download or read it online for free here:
Download link
(multiple PS files)

Similar books

Book cover: Vector Models for Data-Parallel ComputingVector Models for Data-Parallel Computing
by - 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.
(9265 views)
Book cover: Essentials of MetaheuristicsEssentials of Metaheuristics
by
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.
(8834 views)
Book cover: Data Structures and Algorithm Analysis in C++Data Structures and Algorithm Analysis in C++
by - Dover Publications
A comprehensive treatment focusing on efficient data structures and algorithms, this text explains how to select or design the data structure best suited to specific problems. It uses C++ programming language and is suitable for second-year courses.
(17746 views)
Book cover: Design and Analysis of AlgorithmsDesign and Analysis of Algorithms
by - Duke University
The main topics to be covered in this course are: Design Techniques; Searching; Prioritizing; Graph Algorithms; Topological Algorithms; Geometric Algorithms; NP-completeness. The emphasis will be on algorithm design and on algorithm analysis.
(16209 views)