LEDA SetA Platform for Combinatorial and Geometric Computing |
|
| Author:
| Mehlhorn, Kurt
Näher, Stefan |
| ISBN: | 978-0-521-10941-3 |
| Publication Date: | Jun 2009 |
| Publisher: | Cambridge University Press
|
| Book Format: | Multiple-item retail product |
| List Price: | USD $93.99 |
Book Description:
|
LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing. In each of the core areas of data structures, graph and network algorithms, and computational geometry, LEDA covers all (and more) that is found in the standard textbooks. LEDA is the first such library and this is the first book devoted to it. Written by the main authors of LEDA it is the definitive account, making the book essential for all workers in algorithms, data...
More DescriptionLEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing. In each of the core areas of data structures, graph and network algorithms, and computational geometry, LEDA covers all (and more) that is found in the standard textbooks. LEDA is the first such library and this is the first book devoted to it. Written by the main authors of LEDA it is the definitive account, making the book essential for all workers in algorithms, data structures and computational geometry.