Algorithmen für Rollenzuweisungen

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:855635485df368a2b1b5b2798816dbf8

BROGHAMMER, Matthias, 2005. Algorithmen für Rollenzuweisungen [Master thesis]

@mastersthesis{Broghammer2005Algor-6145, title={Algorithmen für Rollenzuweisungen}, year={2005}, author={Broghammer, Matthias} }

<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/6145"> <dcterms:alternative>Algorithms for role assignments</dcterms:alternative> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:contributor>Broghammer, Matthias</dc:contributor> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6145/3/Bachelorarbeit.pdf"/> <dc:rights>deposit-license</dc:rights> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:09:48Z</dc:date> <dc:format>application/pdf</dc:format> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:title>Algorithmen für Rollenzuweisungen</dcterms:title> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103416863-3868037-7"/> <dcterms:abstract xml:lang="eng">Role assignments can be described as partitions over the set of vertices of a graph, which are "compatible" with the structure of its edges. Calculating such partitions, i.e. defined by structural, exact or regular equivalences, can be performed by straight forward but rather slow algorithms, but there also exist efficient ones, however being more complex. These allow to solve even big problems in adequate time. Based on the the simple and slow algorithms, the aim of this bachelor thesis is to analyze, implement and, if applicable, to generalise their efficient counterparts.</dcterms:abstract> <dc:language>deu</dc:language> <dcterms:issued>2005</dcterms:issued> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6145/3/Bachelorarbeit.pdf"/> <dc:creator>Broghammer, Matthias</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:09:48Z</dcterms:available> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6145"/> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Bachelorarbeit.pdf 43

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto