Algorithmen für Rollenzuweisungen

Broghammer, Matthias

Algorithmen für Rollenzuweisungen

Files

Bachelorarbeit.pdf(2.06 MB)

Date

2005

Authors

Broghammer, Matthias

Title in another language

Algorithms for role assignments

Publication type

Diploma thesis

Abstract

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.

Summary in another language

Rollenzuweisungen sind Partitionen der Knotenmenge eines Graphen, die mit der Kantenstruktur "verträglich" sind. Für die Berechnung solcher Partitionen, die sich beispielsweise durch strukturelle, exakte oder reguläre Äquivalenzen ergeben, existieren neben einfachen und jedoch gleichzeitig langsamen auch komplexere, dafür aber auch effiziente Algorithmen. Diese ermöglichen es, selbst sehr große Problemeingaben in angemessener Zeit zu lösen. Ziel dieser Bachelor-Arbeit ist es, ausgehend von einfachen Algorithmen, ihre effizienten Gegenspieler zu untersuchen, zu implementieren und gegebenenfalls zu verallgemeinern.

Subject (DDC)

004 Computer Science

Keywords

Rollenzuweisung,strukturelle Äquivalenz,exakte Äquivalenz,reguläre Äquivalenz,Role assignment,structural equivalence,exact equivalence,regular equivalence

Cite This

ISO 690

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

BibTex

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

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/6145">
    <dc:rights>terms-of-use</dc:rights>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6145/3/Bachelorarbeit.pdf"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:creator>Broghammer, Matthias</dc:creator>
    <dc:language>deu</dc:language>
    <dc:format>application/pdf</dc:format>
    <dcterms:alternative>Algorithms for role assignments</dcterms:alternative>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:title>Algorithmen für Rollenzuweisungen</dcterms:title>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6145"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:09:48Z</dcterms:available>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6145/3/Bachelorarbeit.pdf"/>
    <dcterms:issued>2005</dcterms:issued>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:09:48Z</dc:date>
    <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>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Broghammer, Matthias</dc:contributor>
  </rdf:Description>
</rdf:RDF>