LEDA: A Platform for Combinatorial and Geometric Computing - Rilegato

Mehlhorn, Kurt; Näher, Stefan

Rilegato

ISBN 10: 0521563291 ISBN 13: 9780521563291

Casa editrice: Cambridge University Press, 1999

Riassunto

LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing on which application programs can be built. In each of the core computer science 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; it is written in C++ and is available on many types of machine. Whilst the software is freely available worldwide and is installed at hundreds of sites, this is the first book devoted to the library. Written by the main authors of LEDA, it is the definitive account, describing how the system is constructed and operates and how it can be used. The authors supply ample examples from a range of areas to show how the library can be used in practice, making the book essential for all workers in algorithms, data structures and computational geometry.

Su questo libro

Recensione:

"LEDA presents a different sort of library, namely, one that supports the type of programming that is the basis of our standard algorithm and data structures courses... LEDA, the book, complements LEDA, the library... I find it both highly commendable and also somewhat mind-boggling that well-known researchers will take time to contribute in substantialways to the practice: commendable, because such work contributes to the vitality and progress of the practical side of our discipline, while simultaneously validating the need for fundamental research; and mind-boggling because I can only imagine the investment of time such a project requires. A measure of LEDA'S success can ben found in its use. At the time the book was written over 1500 institutions had intalled LEDA on local systems... And so, my hat is off to Kurt Mehlhorn and Stefan Naher for their fine contribution to our discipline." SIGACT News

"...a comprehensive treatment of the system and its use." Mathematical Reviews

Descrizione del libro:

LEDA is the first library of efficient data types and algorithms and a platform for combinatorial and geometric computing 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.

Su questa edizione

• Editore: Cambridge University Press
• Data di pubblicazione: 1999
• ISBN 10: 0521563291
• ISBN 13: 9780521563291
• Rilegatura: Copertina rigida
• Numero di pagine: 1034