Algorithms and Complexity

Veröffentlichungen

COMPUTATIONAL LOGIC

Autoren: KOWALSKI R (IMPERIAL COLLEGE, LONDON (GB))
Veröffentlicht in: EXTRACT: ESPRIT '90 : CONFERENCE PROCEEDINGS (1990) PP. 768-773 (EUR 13148) KLUWER ACADEMIC PUBLISHERS GROUP, PO BOX 322, 3300 AH DORDRECHT (NL), 1990, Page(s) 768-773

Exploitable results

Combinatorial and geometric computing is a core area of computer science. Dealing with objects such as graphs, sequences, dictionaries, trees, points, flows, matching, segments, shortest paths, etc, the subject forms the basis for application areas such as discrete optimisation, resource scheduling, traffic control and computer aided design (CAD). In contrast to other areas of computing, there is no standard library of the data structures and algorithms used. Under the ALCOM project a comprehensive library of algorithms and data structures in this area of computing has been compiled in a form, which is accessible to non-experts. The library, called LEDA (Library of Efficient Data Types and Algorithms), contains all of the relevant building blocks in an easy to use and efficient form. LEDA is implemented in C++, and can be used with almost any C++ compiler. It is continuously updated with the most recent and efficient implementations. It is available for many common operating systems (MS Windows, Unix, Linux) on all relevant platforms (i386, IA 64, Sparc, HP, SGI, etc.). A commercial as well as a research version of the library is available from Algorithmic Solutions Software GmbH and from Quappa Inc.: http://www.quappa.com Email: quappa@quappa.com http://www.algorithmic-solutions.com Email: leda@algorithmic-solutions.com

Veröffentlichungen

Exploitable results

Diese Seite teilen

Herunterladen