On graph combinatorics to improve eigenvector-based measures of centrality in directed networks
© 2016. This version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2016 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/90335 |
| Acceso en línea: | https://hdl.handle.net/2117/90335 https://dx.doi.org/10.1016/j.laa.2016.04.011 |
| Access Level: | acceso abierto |
| Palabra clave: | Algebras, Linear Directed graphs Centrality Eigenvector PageRank Topology Network Àlgebra lineal Grafs dirigits Àrees temàtiques de la UPC::Informàtica |
| Sumario: | © 2016. This version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ |
|---|