Please use this identifier to cite or link to this item: doi:10.22028/D291-26124
Title: LEDA : a library of efficient data types and algorithms
Author(s): Mehlhorn, Kurt
Näher, Stefan
Language: English
Year of Publication: 1989
OPUS Source: Saarbrücken, 1989
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: LEDA is a library of efficient data types and algorithms. At present, its strength is graph algorithms and related data structures. The computational geometry part is evolving. The main features of the library are 1) a clear separation of specification and implementation 2) parameterized data types 3) a comfortable data type graph, 4) its extendibility, and 5) its ease of use.
Link to this record: urn:nbn:de:bsz:291-scidok-41779
hdl:20.500.11880/26180
http://dx.doi.org/10.22028/D291-26124
Series name: Technischer Bericht / A / Fachbereich Informatik, Universität des Saarlandes
Series volume: 1989/04
Date of registration: 5-Sep-2011
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
fb14_1989_04.pdf5,12 MBAdobe PDFView/Open


Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.