On graph combinatorics to improve eigenvector-based measures of centrality in directed networks (Q286157): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2016.04.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2337993075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new status index derived from sociometric analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Birational equivalence of reduced graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks / rank
 
Normal rank

Latest revision as of 00:19, 12 July 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
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references