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: Average Case Analysis of Algorithms on SequencesAverage Case Analysis of Algorithms on Sequences
by - 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.
(7245 views)
Book cover: Notes on Data Structures and Programming TechniquesNotes on Data Structures and Programming Techniques
by - Yale University
Topics include programming in C; data structures (arrays, stacks, queues, lists, trees, heaps, graphs); sorting and searching; storage allocation and management; data abstraction; programming style; testing and debugging; writing efficient programs.
(1951 views)
Book cover: Randomized AlgorithmsRandomized Algorithms
by - ESSLLI
The first part of the course gives an introduction to randomized algorithms and to standard techniques for their derandomization. The second part presents applications of the probabilistic method to the construction of logical models.
(5825 views)
Book cover: Algorithms and Data Structures: The Basic ToolboxAlgorithms and Data Structures: The Basic Toolbox
by - Springer
This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, etc.
(7019 views)