Combining LEDA with Customizable Implementations of Graph Algorithms

Nissen, Marco; Weihe, Karsten

Combining LEDA with Customizable Implementations of Graph Algorithms

Dateien

preprint_017.pdfGröße: 403.3 KBDownloads: 201

Datum

1996

Autor:innen

Nissen, Marco

Weihe, Karsten

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Preprint

Publikationsstatus

Published

Zusammenfassung

Efficiency, flexibility, and ease of use are desirable goals in library development, but it seems next to impossible to achieve all three goals simultaneously. The Library of Efficient Algorithms and Data Structures (LEDA) focuses on efficiency and ease of use. On the other hand, we have developed concepts which focus on efficiency and flexibility (Konstanzer Schriften Nos. 1, 9, and 15 in Mathematik und Informatik). In the present manuscript, we introduce a possible integration of these concepts into LEDA.

Fachgebiet (DDC)

004 Informatik

Zitieren

ISO 690

NISSEN, Marco, Karsten WEIHE, 1996. Combining LEDA with Customizable Implementations of Graph Algorithms

BibTex

@unpublished{Nissen1996Combi-6366,
  year={1996},
  title={Combining LEDA with Customizable Implementations of Graph Algorithms},
  author={Nissen, Marco and Weihe, Karsten}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/6366">
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:language>eng</dc:language>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6366/1/preprint_017.pdf"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:12:14Z</dcterms:available>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6366/1/preprint_017.pdf"/>
    <dcterms:title>Combining LEDA with Customizable Implementations of Graph Algorithms</dcterms:title>
    <dc:format>application/pdf</dc:format>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:rights>terms-of-use</dc:rights>
    <dc:contributor>Nissen, Marco</dc:contributor>
    <dc:contributor>Weihe, Karsten</dc:contributor>
    <dcterms:issued>1996</dcterms:issued>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6366"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:12:14Z</dc:date>
    <dcterms:abstract xml:lang="eng">Efficiency, flexibility, and ease of use are desirable goals in library development, but it seems next to impossible to achieve all three goals simultaneously. The Library of Efficient Algorithms and Data Structures (LEDA) focuses on efficiency and ease of use. On the other hand, we have developed concepts which focus on efficiency and flexibility (Konstanzer Schriften Nos. 1, 9, and 15 in Mathematik und Informatik). In the present manuscript, we introduce a possible integration of these concepts into LEDA.</dcterms:abstract>
    <dc:creator>Weihe, Karsten</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Nissen, Marco</dc:creator>
  </rdf:Description>
</rdf:RDF>