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: Data Structures and AlgorithmsData Structures and Algorithms
by - GitBook
This book is a survey of several standard algorithms and data structures. It will also introduce the methodology used to perform a formal analysis of an algorithm so that the reason behind the different implementations can be better understood.
(2712 views)
Book cover: Algorithms: Fundamental TechniquesAlgorithms: Fundamental Techniques
by - Wikibooks
An accessible introduction into the design and analysis of efficient algorithms. It explains only the most basic techniques, and gives intuition for and an introduction to the rigorous mathematical methods needed to describe and analyze them.
(11177 views)
Book cover: Data Structures and Algorithm Analysis in JavaData Structures and Algorithm Analysis in Java
by - Dover Publications
A comprehensive treatment focusing on the creation of efficient data structures and algorithms, explaining how to select the data structure best suited to specific problems. It uses Java programming language and is suitable for second-year courses.
(8989 views)
Book cover: Algorithms and Data Structures for External MemoryAlgorithms and Data Structures for External Memory
by - Now Publishers
The book describes several useful paradigms for the design and implementation of efficient EM algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, etc.
(6707 views)