Centrality Estimation in Large Networks

Kurzanzeige
dc.contributor.authorBrandes, Ulrik
dc.contributor.authorPich, Christiandeu
dc.date.accessioned2011-03-24T15:59:57Zdeu
dc.date.available2011-03-24T15:59:57Zdeu
dc.date.issued2007deu
dc.description.abstractCentrality 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.eng
dc.description.versionpublished
dc.format.mimetypeapplication/pdfdeu
dc.identifier.citationFirst publ. in: International Journal of Bifurcation and Chaos 17 (2007), 7, pp. 2303-2318deu
dc.identifier.doi10.1142/S0218127407018403
dc.identifier.ppn30211288Xdeu
dc.identifier.urihttp://kops.uni-konstanz.de/handle/123456789/5772
dc.language.isoengdeu
dc.legacy.dateIssued2009deu
dc.rightsAttribution-NonCommercial-NoDerivs 2.0 Generic
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/2.0/
dc.subject.ddc004deu
dc.titleCentrality Estimation in Large Networkseng
dc.typeJOURNAL_ARTICLEdeu
dspace.entity.typePublication
kops.citation.bibtex
@article{Brandes2007Centr-5772,
  year={2007},
  doi={10.1142/S0218127407018403},
  title={Centrality Estimation in Large Networks},
  number={7},
  volume={17},
  issn={0218-1274},
  journal={International Journal of Bifurcation and Chaos},
  pages={2303--2318},
  author={Brandes, Ulrik and Pich, Christian}
}
kops.citation.iso690BRANDES, Ulrik, Christian PICH, 2007. Centrality Estimation in Large Networks. In: International Journal of Bifurcation and Chaos. 2007, 17(7), pp. 2303-2318. ISSN 0218-1274. Available under: doi: 10.1142/S0218127407018403deu
kops.citation.iso690BRANDES, Ulrik, Christian PICH, 2007. Centrality Estimation in Large Networks. In: International Journal of Bifurcation and Chaos. 2007, 17(7), pp. 2303-2318. ISSN 0218-1274. Available under: doi: 10.1142/S0218127407018403eng
kops.citation.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/5772">
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5772"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <dc:format>application/pdf</dc:format>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <dc:contributor>Pich, Christian</dc:contributor>
    <dc:language>eng</dc:language>
    <dcterms:bibliographicCitation>First publ. in: International Journal of Bifurcation and Chaos 17 (2007), 7, pp. 2303-2318</dcterms:bibliographicCitation>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5772/1/estimations.pdf"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5772/1/estimations.pdf"/>
    <dcterms:title>Centrality Estimation in Large Networks</dcterms:title>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Pich, Christian</dc:creator>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:57Z</dc:date>
    <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>
    <dcterms:issued>2007</dcterms:issued>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:57Z</dcterms:available>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
  </rdf:Description>
</rdf:RDF>
kops.description.openAccessopenaccessgreen
kops.flag.knbibliographytrue
kops.identifier.nbnurn:nbn:de:bsz:352-opus-72074deu
kops.opus.id7207deu
kops.sourcefieldInternational Journal of Bifurcation and Chaos. 2007, <b>17</b>(7), pp. 2303-2318. ISSN 0218-1274. Available under: doi: 10.1142/S0218127407018403deu
kops.sourcefield.plainInternational Journal of Bifurcation and Chaos. 2007, 17(7), pp. 2303-2318. ISSN 0218-1274. Available under: doi: 10.1142/S0218127407018403deu
kops.sourcefield.plainInternational Journal of Bifurcation and Chaos. 2007, 17(7), pp. 2303-2318. ISSN 0218-1274. Available under: doi: 10.1142/S0218127407018403eng
relation.isAuthorOfPublicationfa1660c9-a071-4d01-9bdd-7adcd0e2d7d7
relation.isAuthorOfPublication.latestForDiscoveryfa1660c9-a071-4d01-9bdd-7adcd0e2d7d7
source.bibliographicInfo.fromPage2303
source.bibliographicInfo.issue7
source.bibliographicInfo.toPage2318
source.bibliographicInfo.volume17
source.identifier.issn0218-1274
source.periodicalTitleInternational Journal of Bifurcation and Chaos

Dateien

Originalbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
estimations.pdf
Größe:
11.88 MB
Format:
Adobe Portable Document Format
estimations.pdf
estimations.pdfGröße: 11.88 MBDownloads: 1914

Sammlungen

Informatik und Informationswissenschaft: Publikationen