On Variants of Shortest-Path Betweenness Centrality and their Generic Computation

Brandes, Ulrik

On Variants of Shortest-Path Betweenness Centrality and their Generic Computation

Dateien

variants.pdfGröße: 231.58 KBDownloads: 3176

Datum

2008

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Zeitschriftenartikel

Publikationsstatus

Published

Erschienen in

Social Networks. 2008, 30(2), pp. 136-145. Available under: doi: 10.1016/j.socnet.2007.11.001

Zusammenfassung

Betweenness centrality based on shortest paths is a standard measure of control utilized in numerous studies and implemented in all relevant software tools for network analysis. In this paper, a number of variants are reviewed, placed into context, and shown to be computable with simple variants of the algorithm commonly used for the standard case.

Fachgebiet (DDC)

004 Informatik

Schlagwörter

betweenness centrality, algorithms, valued networks, load centrality

Zitieren

ISO 690

BRANDES, Ulrik, 2008. On Variants of Shortest-Path Betweenness Centrality and their Generic Computation. In: Social Networks. 2008, 30(2), pp. 136-145. Available under: doi: 10.1016/j.socnet.2007.11.001

BibTex

@article{Brandes2008Varia-5940,
  year={2008},
  doi={10.1016/j.socnet.2007.11.001},
  title={On Variants of Shortest-Path Betweenness Centrality and their Generic Computation},
  number={2},
  volume={30},
  journal={Social Networks},
  pages={136--145},
  author={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/5940">
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:01:30Z</dcterms:available>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:01:30Z</dc:date>
    <dc:language>eng</dc:language>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5940"/>
    <dcterms:title>On Variants of Shortest-Path Betweenness Centrality and their Generic Computation</dcterms:title>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5940/1/variants.pdf"/>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <dcterms:bibliographicCitation>First publ. in: Social Networks ; 30 (2008), 2. - S. 136-145</dcterms:bibliographicCitation>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <dcterms:abstract xml:lang="eng">Betweenness centrality based on shortest paths is a standard measure of control utilized in numerous studies and implemented in all relevant software tools for network analysis. In this paper, a number of variants are reviewed, placed into context, and shown to be computable with simple variants of the algorithm commonly used for the standard case.</dcterms:abstract>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5940/1/variants.pdf"/>
    <dcterms:issued>2008</dcterms:issued>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <dc:format>application/pdf</dc:format>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja