Scalable Katz Ranking Computation in Large Static and Dynamic Graphs

DOI10.4230/LIPIcs.ESA.2018.42OpenAlexW2963858523MaRDI QIDQ5009604

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

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1807.03847

zbMATH Keywords

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Scalable Katz Ranking Computation in Large Static and Dynamic Graphs

Uses Software

• SNAP
• GraphBLAS
• KONECT
• NetworKit

Cites Work

• Efficient algorithms for updating betweenness centrality in fully dynamic graphs
• A new status index derived from sociometric analysis
• Fast Matrix Computations for Pairwise and Columnwise Commute Times and Katz Scores
• 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