Structural Similarity in Graphs : A Relaxation Approach for Role Assignment


Dateien zu dieser Ressource

Prüfsumme: MD5:e39935dba28444707d3ab1f492bc0458

BRANDES, Ulrik, Jürgen LERNER, 2005. Structural Similarity in Graphs : A Relaxation Approach for Role Assignment. In: FLEISCHER, Rudolf, ed., Gerhard TRIPPEN, ed.. Algorithms and Computation. Berlin, Heidelberg:Springer Berlin Heidelberg, pp. 184-195. ISBN 978-3-540-24131-7

@inproceedings{Brandes2005Struc-5942, title={Structural Similarity in Graphs : A Relaxation Approach for Role Assignment}, year={2005}, doi={10.1007/978-3-540-30551-4_18}, number={3341}, isbn={978-3-540-24131-7}, address={Berlin, Heidelberg}, publisher={Springer Berlin Heidelberg}, series={Lecture Notes in Computer Science}, booktitle={Algorithms and Computation}, pages={184--195}, editor={Fleischer, Rudolf and Trippen, Gerhard}, author={Brandes, Ulrik and Lerner, Jürgen} }

<rdf:RDF xmlns:rdf="" xmlns:bibo="" xmlns:dc="" xmlns:dcterms="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dc:creator>Lerner, Jürgen</dc:creator> <dc:format>application/pdf</dc:format> <dc:contributor>Lerner, Jürgen</dc:contributor> <bibo:uri rdf:resource=""/> <dc:rights>deposit-license</dc:rights> <dcterms:issued>2005</dcterms:issued> <dcterms:bibliographicCitation>First publ. in: Proceedings of the 15th International Symposium Algorithms and Computation (ISAAC ´04) (LNCS 3341), 2004, pp. 184-195</dcterms:bibliographicCitation> <dc:contributor>Brandes, Ulrik</dc:contributor> <dc:date rdf:datatype="">2011-03-24T16:01:31Z</dc:date> <dcterms:title>Structural Similarity in Graphs : A Relaxation Approach for Role Assignment</dcterms:title> <dcterms:available rdf:datatype="">2011-03-24T16:01:31Z</dcterms:available> <dcterms:rights rdf:resource=""/> <dc:language>eng</dc:language> <dc:creator>Brandes, Ulrik</dc:creator> <dcterms:abstract xml:lang="eng">Standard methods for role assignment partition the vertex set of a graph in such a way that vertices in the same class can be considered to have equivalent roles in the graph. Several classes of equivalence relations such as regular equivalence and equitable partitions have been proposed for role assignment, but they all suffer from the strictness of classifying vertices into being either equivalent or not. It is an open problem how to allow for varying degrees of similarity. Proposals include ad-hoc algorithmic approaches and optimization approaches which are computationally hard. In this paper we introduce the concept of structural similarity by relaxation of equitable partitions, thus providing a theoretical foundation for similarity measures which enjoys desirable properties with respect to existence, structure, and tractability.</dcterms:abstract> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

bl_ssg_04.pdf 95

Das Dokument erscheint in:

deposit-license Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: deposit-license

KOPS Suche


Mein Benutzerkonto