Publikation:

Centrality Measures Based on Current Flow

Vorschaubild

Dateien

bf_cmbcf_05.pdf
bf_cmbcf_05.pdfGröße: 220.78 KBDownloads: 2251

Datum

2005

Autor:innen

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-77670
DOI (zitierfähiger Link)
https://doi.org/10.1007/978-3-540-31856-9_44
ArXiv-ID

Internationale Patentnummer

Link zur Lizenz
Urheberrechtlich geschützt

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung
Open Access Green

Sammlungen

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

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

DIEKERT, Volker, ed., Bruno DURAND, ed.. STACS 2005. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 533-544. Lecture Notes in Computer Science. 3404. ISBN 978-3-540-24998-6. Available under: doi: 10.1007/978-3-540-31856-9_44

Zusammenfassung

We consider variations of two well-known centrality measures, betweenness and closeness, witha different model of information spread. Rather than along shortest paths only, it is assumed that information spreads efficiently like an electrical current. We prove that the current-flow variant of closeness centrality is identical with another known measure, information centrality, and give improved algorithms for computing bothmeasures exactly. Since running times and space requirements are prohibitive for large networks, we also present a randomized approximation scheme for current-flow betweenness.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690BRANDES, Ulrik, Daniel FLEISCHER, 2005. Centrality Measures Based on Current Flow. In: DIEKERT, Volker, ed., Bruno DURAND, ed.. STACS 2005. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 533-544. Lecture Notes in Computer Science. 3404. ISBN 978-3-540-24998-6. Available under: doi: 10.1007/978-3-540-31856-9_44
BibTex
@inproceedings{Brandes2005Centr-5680,
  year={2005},
  doi={10.1007/978-3-540-31856-9_44},
  title={Centrality Measures Based on Current Flow},
  number={3404},
  isbn={978-3-540-24998-6},
  publisher={Springer Berlin Heidelberg},
  address={Berlin, Heidelberg},
  series={Lecture Notes in Computer Science},
  booktitle={STACS 2005},
  pages={533--544},
  editor={Diekert, Volker and Durand, Bruno},
  author={Brandes, Ulrik and Fleischer, Daniel}
}
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/5680">
    <dc:format>application/pdf</dc:format>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:rights>terms-of-use</dc:rights>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5680/1/bf_cmbcf_05.pdf"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:18Z</dc:date>
    <dc:language>eng</dc:language>
    <dc:creator>Fleischer, Daniel</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:18Z</dcterms:available>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5680"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Fleischer, Daniel</dc:contributor>
    <dcterms:issued>2005</dcterms:issued>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5680/1/bf_cmbcf_05.pdf"/>
    <dcterms:bibliographicCitation>First publ. in: Proceedings of the 22nd Symposium Theoretical Aspects of Computer Science (STACS ´05) (LNCS 3404), 2005, pp. 533-544</dcterms:bibliographicCitation>
    <dcterms:abstract xml:lang="eng">We consider variations of two well-known centrality measures, betweenness and closeness, witha different model of information spread. Rather than along shortest paths only, it is assumed that information spreads efficiently like an electrical current. We prove that the current-flow variant of closeness centrality is identical with another known measure, information centrality, and give improved algorithms for computing bothmeasures exactly. Since running times and space requirements are prohibitive for large networks, we also present a randomized approximation scheme for current-flow betweenness.</dcterms:abstract>
    <dcterms:title>Centrality Measures Based on Current Flow</dcterms:title>
    <dcterms:isPartOf 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