Scalable Katz Ranking Computation in Large Static and Dynamic Graphs

DOI10.1145/3524615OpenAlexW2850868717MaRDI QIDQ5102079

David A. Bader, Alexander van der Grinten, Henning Meyerhenke, Elisabetta Bergamini, Oded Green

Publication date: 6 September 2022

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3524615

zbMATH Keywords

parallel algorithmsnetwork analysisdynamic graphsKatz centralitytop-\(k\) ranking

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Equivalence constants for certain matrix norms. II
• Efficient algorithms for updating betweenness centrality in fully dynamic graphs
• A new status index derived from sociometric analysis
• Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
• Group Centrality Maximization for Large-scale Graphs
• Computing Top-k Closeness Centrality Faster in Unweighted Graphs
• Computing Top-k Closeness Centrality in Fully-dynamic Graphs
• Networks

This page was built for publication: Scalable Katz Ranking Computation in Large Static and Dynamic Graphs