Distributed Algorithms for Computation of Centrality Measures in Complex Networks
From MaRDI portal
Publication:5280396
DOI10.1109/TAC.2016.2604373zbMath1366.90023arXiv1507.01694MaRDI QIDQ5280396
Keyou You, Li Qiu, Roberto Tempo
Publication date: 27 July 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.01694
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)
Related Items (4)
A general higher-order supracentrality framework based on motifs of temporal networks and multiplex networks ⋮ On predefined-time consensus protocols for dynamic networks ⋮ Tunable Eigenvector-Based Centralities for Multiplex and Temporal Networks ⋮ Eigenvector-Based Centrality Measures for Temporal Networks
This page was built for publication: Distributed Algorithms for Computation of Centrality Measures in Complex Networks