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

From MaRDI portal
Revision as of 20:25, 19 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    20 May 2016
    0 references