Centrality Measures Based on Current Flow
- Startseite
- →
- Informatik und Informationswissenschaft
- →
- Informatik und Informationswissenschaft
- →
- Dokumentanzeige
| Publikationstyp: | Beitrag zu einer Konferenz |
| URI (zitierfähiger Link): | http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-77670 |
| Autor/innen: | Brandes, Ulrik; Fleischer, Daniel |
| Erscheinungsjahr: | 2005 |
| Erschienen in: | STACS 2005 / Diekert, Volker; Durand, Bruno (Hrsg.). - Berlin, Heidelberg : Springer Berlin Heidelberg, 2005. - (Lecture Notes in Computer Science ; 3404). - S. 533-544. - ISBN 978-3-540-24998-6 |
| DOI (zitierfähiger Link): | https://dx.doi.org/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.
|
| Fachgebiet (DDC): | 004 Informatik |
| Link zur Lizenz: | Nutzungsbedingungen |
| Universitätsbibliographie: | Ja |
Zitieren
Dateien zu dieser Ressource
![[PDF]](/themes/Kops/images/mimes/pdf.png "PDF file"){kind=small}
BRANDES, Ulrik, Daniel FLEISCHER, 2005. Centrality Measures Based on Current Flow. In: DIEKERT, Volker, ed., Bruno DURAND, ed.. STACS 2005. Berlin, Heidelberg:Springer Berlin Heidelberg, pp. 533-544. ISBN 978-3-540-24998-6. Available under: doi: 10.1007/978-3-540-31856-9_44
@inproceedings{Brandes2005Centr-5680, title={Centrality Measures Based on Current Flow}, year={2005}, doi={10.1007/978-3-540-31856-9_44}, number={3404}, isbn={978-3-540-24998-6}, address={Berlin, Heidelberg}, publisher={Springer 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 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/5680"> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <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> <dc:language>eng</dc:language> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5680/1/bf_cmbcf_05.pdf"/> <dc:contributor>Fleischer, Daniel</dc:contributor> <dc:creator>Fleischer, Daniel</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-24T15:59:18Z</dcterms:available> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5680/1/bf_cmbcf_05.pdf"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:contributor>Brandes, Ulrik</dc:contributor> <dc:format>application/pdf</dc:format> <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:rights rdf:resource="https://kops.uni-konstanz.de/page/termsofuse"/> <dc:creator>Brandes, Ulrik</dc:creator> <dcterms:issued>2005</dcterms:issued> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:18Z</dc:date> <dcterms:title>Centrality Measures Based on Current Flow</dcterms:title> <dc:rights>terms-of-use</dc:rights> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5680"/> </rdf:Description> </rdf:RDF>
Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)
| bf_cmbcf_05.pdf | 533 |
Das Dokument erscheint in:
KOPS Suche
Stöbern
Mein Benutzerkonto
