On Finding Graph Clusterings with Maximum Modularity

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:bea5eaade26f39c14e133b7a55d0a9b9

BRANDES, Ulrik, Daniel DELLING, Marco GAERTLER, Robert GÖRKE, Martin HOEFER, Zoran NIKOLOSKI, Dorothea WAGNER, 2007. On Finding Graph Clusterings with Maximum Modularity. In: BRANDSTÄDT, Andreas, ed., Dieter KRATSCH, ed., Haiko MÜLLER, ed.. Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg:Springer Berlin Heidelberg, pp. 121-132. ISBN 978-3-540-74838-0. Available under: doi: 10.1007/978-3-540-74839-7_12

@inproceedings{Brandes2007Findi-5883, title={On Finding Graph Clusterings with Maximum Modularity}, year={2007}, doi={10.1007/978-3-540-74839-7_12}, isbn={978-3-540-74838-0}, address={Berlin, Heidelberg}, publisher={Springer Berlin Heidelberg}, series={Lecture Notes in Computer Science}, booktitle={Graph-Theoretic Concepts in Computer Science}, pages={121--132}, editor={Brandstädt, Andreas and Kratsch, Dieter and Müller, Haiko}, author={Brandes, Ulrik and Delling, Daniel and Gaertler, Marco and Görke, Robert and Hoefer, Martin and Nikoloski, Zoran and Wagner, Dorothea} }

<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/5883"> <dc:creator>Gaertler, Marco</dc:creator> <dc:creator>Hoefer, Martin</dc:creator> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103416863-3868037-7"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Nikoloski, Zoran</dc:contributor> <dc:creator>Wagner, Dorothea</dc:creator> <dc:contributor>Delling, Daniel</dc:contributor> <dc:contributor>Wagner, Dorothea</dc:contributor> <dc:contributor>Gaertler, Marco</dc:contributor> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:creator>Görke, Robert</dc:creator> <dc:creator>Brandes, Ulrik</dc:creator> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:57Z</dcterms:available> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5883"/> <dc:format>application/pdf</dc:format> <dc:creator>Delling, Daniel</dc:creator> <dc:language>eng</dc:language> <dc:creator>Nikoloski, Zoran</dc:creator> <dcterms:issued>2007</dcterms:issued> <dcterms:abstract xml:lang="eng">Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the complex systems literature, although its properties are not well understood. We study the problem of finding clusterings with maximum modularity, thus providing theoretical foundations for past and present work based on this measure. More precisely, we prove the conjectured hardness of maximizing modularity both in the general case and with the restriction to cuts, and give an Integer Linear Programming formulation. This is complemented by first insights into the behavior and performance of the commonly applied greedy agglomaration approach.</dcterms:abstract> <dc:contributor>Brandes, Ulrik</dc:contributor> <dcterms:title>On Finding Graph Clusterings with Maximum Modularity</dcterms:title> <dc:contributor>Hoefer, Martin</dc:contributor> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:57Z</dc:date> <dc:contributor>Görke, Robert</dc:contributor> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5883/1/bdgghnw_fgcmm_07.pdf"/> <dcterms:bibliographicCitation>First publ. in: Proceedings of the 33rd International Workshop Graph-Theoretic Concepts in Computer Science (WG ´07) (LNCS 4769), 2007, pp. 121-132</dcterms:bibliographicCitation> <dc:rights>deposit-license</dc:rights> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5883/1/bdgghnw_fgcmm_07.pdf"/> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

bdgghnw_fgcmm_07.pdf 323

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto