Type of Publication: | Journal article |
URI (citable link): | http://nbn-resolving.de/urn:nbn:de:bsz:352-0-277862 |
Author: | Brandes, Ulrik; Hildenbrand, Jan |
Year of publication: | 2014 |
Published in: | Network Science ; 2 (2014), 3. - pp. 416-418. - ISSN 2050-1242. - eISSN 2050-1250 |
DOI (citable link): | https://dx.doi.org/10.1017/nws.2014.25 |
Summary: |
An incredible number of centrality indices has been proposed to date (Todeschini & Consonni, 2009). Four of them, however, can be considered prototypical because they operationalize distinct concepts of centrality and together cover the bulk of analyses and empirical uses: degree, closeness, betweenness, and eigenvector centrality.
|
Subject (DDC): | 004 Computer Science |
Link to License: | In Copyright |
Bibliography of Konstanz: | Yes |
xmlui.ArtifactBrowser.ItemViewer.detail.textAllianzLicense | |
BRANDES, Ulrik, Jan HILDENBRAND, 2014. Smallest graphs with distinct singleton centers. In: Network Science. 2(3), pp. 416-418. ISSN 2050-1242. eISSN 2050-1250. Available under: doi: 10.1017/nws.2014.25
@article{Brandes2014Small-30373, title={Smallest graphs with distinct singleton centers}, year={2014}, doi={10.1017/nws.2014.25}, number={3}, volume={2}, issn={2050-1242}, journal={Network Science}, pages={416--418}, author={Brandes, Ulrik and Hildenbrand, Jan} }
Brandes_0-277862.pdf | 521 |