Algorithms for recalculating alpha and eigenvector centrality measures using graph partitioning techniques

DOI10.1007/978-3-031-17820-7_24MaRDI QIDQ6153230zbMATH OpenFDO

Authors Collins Anguzu, C. Engström, H. Kasumba, John Magero Mango, Sergei Silvestrov

Publication date 16 March 2024

Published in Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

zbMATH Keywords

graph partitioningeigenvector centralityalpha centrality

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• A Faster Algorithm to Update Betweenness Centrality after Node Alteration
• On graph combinatorics to improve eigenvector-based measures of centrality in directed networks
• Ranking of Closeness Centrality for Large-Scale Social Networks
• A faster algorithm to update betweenness centrality after node alteration
• Network Analysis

Cites work

• scientific article; zbMATH DE number 6013704 (Why is no real title available?)
• scientific article; zbMATH DE number 1460605 (Why is no real title available?)
• A Reordering for the PageRank Problem
• Depth-First Search and Linear Graph Algorithms
• Handbook of Approximation Algorithms and Metaheuristics
• Numerical methods for large eigenvalue problems
• Parallel static and dynamic multi‐constraint graph partitioning

This page was built for publication: Algorithms for recalculating alpha and eigenvector centrality measures using graph partitioning techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153230)