Abstract
We give an overview of the LEDA platform for combinatorial and geometric computing and an account of its development. We discuss our motivation for building LEDA and to what extent we have reached our goals. We also discuss some recent theoretical developments. This paper contains no new technical material. It is intended as a guide to existing publications about the system. We refer the reader also to our web-pages for more information.
Cite
CITATION STYLE
Mehlhom, K., Naher, S., & Uhrig, C. (1997). The LEDA platform for combinatorial and geometric computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1256, pp. 7–16). Springer Verlag. https://doi.org/10.1007/3-540-63165-8_161
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
