Combining LEDA with Customizable Implementations of Graph Algorithms

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:31f82ade1c8dad8484e37b5ae153f65a

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

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

<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/rdf/resource/123456789/6366"> <dc:contributor>Nissen, Marco</dc:contributor> <dc:format>application/pdf</dc:format> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <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> <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> <dc:language>eng</dc:language> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:12:14Z</dc:date> <dspace:hasBitstream 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> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6366/1/preprint_017.pdf"/> <dc:creator>Nissen, Marco</dc:creator> <dc:creator>Weihe, Karsten</dc:creator> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6366"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103416863-3868037-7"/> <dc:contributor>Weihe, Karsten</dc:contributor> <dcterms:issued>1996</dcterms:issued> <dc:rights>deposit-license</dc:rights> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

preprint_017.pdf 77

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto