Publikation:

Topology manipulations for speeding betweenness centrality computation

Vorschaubild

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2015

Autor:innen

Puzis, Rami
Elovici, Yuval
Zilberman, Polina
Dolev, Shlomi

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
DOI (zitierfähiger Link)
https://doi.org/10.1093/comnet/cnu015
ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung

Sammlungen

Informatik und Informationswissenschaft: Publikationen
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published

Erschienen in

Journal of Complex Networks. 2015, 3(1), pp. 84-112. ISSN 2051-1310. eISSN 2051-1329. Available under: doi: 10.1093/comnet/cnu015

Zusammenfassung

We propose and evaluate two complementary heuristics to speed up exact computation of the shortest-path betweenness centrality (BC). Both heuristics are relatively simple adaptations of the standard algorithm for BC. Consequently, they generalize the computation of edge betweenness and most other variants, and can be used to further speed up betweenness estimation algorithms, as well. In the first heuristic, structurally equivalent vertices are contracted based on the observation that they have the same centrality and also contribute equally to the centrality of others. In the second heuristic, we first apply a linear-time betweenness algorithm on the block-cut-point tree and then compute the remaining contributions separately in each bi-connected component. Experiments on a variety of large graphs illustrate the efficiency and complementarity of our heuristics.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

structural analysis of networks, betweenness centrality, topology reduction

Konferenz

Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690PUZIS, Rami, Yuval ELOVICI, Polina ZILBERMAN, Shlomi DOLEV, Ulrik BRANDES, 2015. Topology manipulations for speeding betweenness centrality computation. In: Journal of Complex Networks. 2015, 3(1), pp. 84-112. ISSN 2051-1310. eISSN 2051-1329. Available under: doi: 10.1093/comnet/cnu015
BibTex
@article{Puzis2015Topol-30388,
  year={2015},
  doi={10.1093/comnet/cnu015},
  title={Topology manipulations for speeding betweenness centrality computation},
  number={1},
  volume={3},
  issn={2051-1310},
  journal={Journal of Complex Networks},
  pages={84--112},
  author={Puzis, Rami and Elovici, Yuval and Zilberman, Polina and Dolev, Shlomi and Brandes, Ulrik}
}
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/30388">
    <dc:contributor>Zilberman, Polina</dc:contributor>
    <dc:creator>Dolev, Shlomi</dc:creator>
    <dc:contributor>Elovici, Yuval</dc:contributor>
    <dc:creator>Zilberman, Polina</dc:creator>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <dcterms:title>Topology manipulations for speeding betweenness centrality computation</dcterms:title>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:language>eng</dc:language>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/30388"/>
    <dc:creator>Elovici, Yuval</dc:creator>
    <dcterms:issued>2015</dcterms:issued>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2015-03-18T12:58:12Z</dcterms:available>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2015-03-18T12:58:12Z</dc:date>
    <dc:contributor>Dolev, Shlomi</dc:contributor>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:abstract xml:lang="eng">We propose and evaluate two complementary heuristics to speed up exact computation of the shortest-path betweenness centrality (BC). Both heuristics are relatively simple adaptations of the standard algorithm for BC. Consequently, they generalize the computation of edge betweenness and most other variants, and can be used to further speed up betweenness estimation algorithms, as well. In the first heuristic, structurally equivalent vertices are contracted based on the observation that they have the same centrality and also contribute equally to the centrality of others. In the second heuristic, we first apply a linear-time betweenness algorithm on the block-cut-point tree and then compute the remaining contributions separately in each bi-connected component. Experiments on a variety of large graphs illustrate the efficiency and complementarity of our heuristics.</dcterms:abstract>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Puzis, Rami</dc:creator>
    <dc:contributor>Puzis, Rami</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet
Diese Publikation teilen