On graph combinatorics to improve eigenvector-based measures of centrality in directed networks (Q286157): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.LAA.2016.04.011 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.LAA.2016.04.011 / rank | |||
Normal rank | |||
Latest revision as of 00:22, 28 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On graph combinatorics to improve eigenvector-based measures of centrality in directed networks |
scientific article |
Statements
On graph combinatorics to improve eigenvector-based measures of centrality in directed networks (English)
0 references
20 May 2016
0 references
centrality
0 references
eigenvector
0 references
PageRank
0 references
topology
0 references
network
0 references
