Aufgrund von Vorbereitungen auf eine neue Version von KOPS, können kommenden Montag und Dienstag keine Publikationen eingereicht werden. (Due to preparations for a new version of KOPS, no publications can be submitted next Monday and Tuesday.)

Centrality Estimation in Large Networks

Cite This

Files in this item

Checksum: MD5:770a25c22ab32a04c97b5db082641120

BRANDES, Ulrik, Christian PICH, 2007. Centrality Estimation in Large Networks. In: International Journal of Bifurcation and Chaos. 17(7), pp. 2303-2318. ISSN 0218-1274. Available under: doi: 10.1142/S0218127407018403

@article{Brandes2007Centr-5772, title={Centrality Estimation in Large Networks}, year={2007}, doi={10.1142/S0218127407018403}, number={7}, volume={17}, issn={0218-1274}, journal={International Journal of Bifurcation and Chaos}, pages={2303--2318}, author={Brandes, Ulrik and Pich, Christian} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dcterms:rights rdf:resource=""/> <dc:creator>Brandes, Ulrik</dc:creator> <dc:creator>Pich, Christian</dc:creator> <dc:contributor>Brandes, Ulrik</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights> <dspace:isPartOfCollection rdf:resource=""/> <bibo:uri rdf:resource=""/> <dcterms:issued>2007</dcterms:issued> <dcterms:bibliographicCitation>First publ. in: International Journal of Bifurcation and Chaos 17 (2007), 7, pp. 2303-2318</dcterms:bibliographicCitation> <dc:date rdf:datatype="">2011-03-24T15:59:57Z</dc:date> <dcterms:isPartOf rdf:resource=""/> <dc:format>application/pdf</dc:format> <dcterms:title>Centrality Estimation in Large Networks</dcterms:title> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:contributor>Pich, Christian</dc:contributor> <dcterms:abstract xml:lang="eng">Centrality indices are an essential concept in network analysis. For those based on shortest-path distances the computation is at least quadratic in the number of nodes, since it usually involves solving the single-source shortest-paths (SSSP) problem from every node. Therefore, exact computation is infeasible for many large networks of interest today. Centrality scores can be estimated, however, from a limited number of SSSP computations. We present results from an experimental study of the quality of such estimates under various selection strategies for the source vertices.</dcterms:abstract> <dspace:hasBitstream rdf:resource=""/> <dc:language>eng</dc:language> <dcterms:available rdf:datatype="">2011-03-24T15:59:57Z</dcterms:available> <dcterms:hasPart rdf:resource=""/> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

estimations.pdf 2009

This item appears in the following Collection(s)

Attribution-NonCommercial-NoDerivs 2.0 Generic Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 2.0 Generic

Search KOPS


My Account