Centralidade (Portuguese Wikipedia)
Analysis of information sources in references of the Wikipedia article "Centralidade" in Portuguese language version.
refsWebsite
Global rank
Portuguese rank
low place
low place
low place
low place
234th place
190th place
741st place
748th place
arxiv.org
- M.E.J. Newman (2005). A measure of betweenness centrality based on random walks|Social Networks. 27. [S.l.: s.n.] pp. 39–54. arXiv:cond-mat/0309045
. doi:10.1016/j.socnet.2004.11.009Papercore summary http://papercore.org/Newman2005.
doi.org
dx.doi.org
- Opsahl, Tore; Agneessens, Filip; Skvoretz, John (2010). «Node centrality in weighted networks: Generalizing degree and shortest paths». Social Networks. 32 (3). 245 páginas. doi:10.1016/j.socnet.2010.03.006
- M.E.J. Newman (2005). A measure of betweenness centrality based on random walks|Social Networks. 27. [S.l.: s.n.] pp. 39–54. arXiv:cond-mat/0309045. doi:10.1016/j.socnet.2004.11.009Papercore summary http://papercore.org/Newman2005.
- Alvarez-Socorro, A. J.; et al. (25 de novembro de 2015). «Eigencentrality based on dissimilarity measures reveals central nodes in complex networks». Scientific Reports (em inglês). 5. PMID 26603652. doi:10.1038/srep17095
- Borgatti, Stephen P.; Everett, Martin G. (2005). «A Graph-Theoretic Perspective on Centrality». Elsevier. Social Networks. 28: 466–484. doi:10.1016/j.socnet.2005.11.005
nature.com
- Alvarez-Socorro, A. J.; et al. (25 de novembro de 2015). «Eigencentrality based on dissimilarity measures reveals central nodes in complex networks». Scientific Reports (em inglês). 5. PMID 26603652. doi:10.1038/srep17095
- «Supplementary Information for Eigencentrality based on dissimilarity measures reveals central nodes in complex networks» (Scientific Reports). Nature Publishing Group. Consultado em 29 de dezembro de 2015
nih.gov
ncbi.nlm.nih.gov
- Alvarez-Socorro, A. J.; et al. (25 de novembro de 2015). «Eigencentrality based on dissimilarity measures reveals central nodes in complex networks». Scientific Reports (em inglês). 5. PMID 26603652. doi:10.1038/srep17095
papercore.org
- M.E.J. Newman (2005). A measure of betweenness centrality based on random walks|Social Networks. 27. [S.l.: s.n.] pp. 39–54. arXiv:cond-mat/0309045. doi:10.1016/j.socnet.2004.11.009Papercore summary http://papercore.org/Newman2005.
- Brandes, Ulrik (2001). «A faster algorithm for betweenness centrality». Journal of Mathematical Sociology. 25: 163–177. Consultado em 10 de novembro de 2011 Paperore summary http://papercore.org/Brandes2001
psu.edu
citeseer.ist.psu.edu
- Brandes, Ulrik (2001). «A faster algorithm for betweenness centrality». Journal of Mathematical Sociology. 25: 163–177. Consultado em 10 de novembro de 2011 Paperore summary http://papercore.org/Brandes2001
toreopsahl.com
- Opsahl, Tore; Agneessens, Filip; Skvoretz, John (2010). «Node centrality in weighted networks: Generalizing degree and shortest paths». Social Networks. 32 (3). 245 páginas. doi:10.1016/j.socnet.2010.03.006
- Tore Opsahl. «Closeness centrality in networks with disconnected components»
umich.edu
www-personal.umich.edu
- M. E. J. Newman. «The mathematics of networks» (PDF). Consultado em 9 de novembro de 2006