Invited Presentation:

The LEDA Platform of Combinatorial and Geometric Computing

Kurt Mehlhorn
Max-Plack-Institut für Informatik, Saarbrücken, Germany.


One of the major differences between combinatorial computing and other areas of computing such as statistics, numerical analysis and linear programming is the use of complex data types. Whilst the built-in types, such as integers, reals, vectors, and matrices, usually suffice in the other areas, combinatorial computing relies heavily on types like stacks, queues, dictionaries, sequences, sorted sequences, priority queues, graphs, points, segments, and so on. In the fall of 1988, we started a project (called LEDA for Library of Efficient Data types and Algorithms) to build a library of data types and algorithms in a form which allows them to be used by non-experts. In this talk we report about the status of the project. The main features of LEDA are:
Conference Home Page