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
Tabu Searchby Wassim Jaziri - InTech
Tabu search is a mathematical optimization method. The goal of the book is to report original researches on algorithms and applications of Tabu Search to real-world problems as well as recent improvements and extensions on its concepts and algorithms.
(14183 views)
A=Bby Marko Petkovsek, Herbert S. Wilf, Doron Zeilberger - AK Peters, Ltd.
The book shows how some computer algorithms can simplify complex summations and if there is no such simplification they will prove this to be the case. The authors present the underlying mathematical theory, and the principle theorems and proofs.
(26546 views)
Open Data Structures: An Introductionby Pat Morin - AU Press
Offered as an introduction to the field of data structures and algorithms, the book covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs.
(15699 views)
Think Data Structuresby Allen B. Downey - Green Tea Press
This book is intended for college students in computer science and related fields. The book also presents basic aspects of software engineering practice, including version control and unit testing. Each chapter ends with an exercises.
(12249 views)