Algebraic Algorithms for Betweenness and Percolation Centrality

DOI10.7155/jgaa.00558zbMath1462.05339OpenAlexW3153457457MaRDI QIDQ4994345

Altansuren Tumurbaatar, Matthew J. Sottile

Publication date: 17 June 2021

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00558

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Computing Betweenness Centrality in Link Streams

Uses Software

• NetworkX
• SparseMatrix
• Julia
• Numba

Cites Work

• Unnamed Item
• Unnamed Item
• Graphs, dioids and semirings. New models and algorithms.
• A faster algorithm for betweenness centrality*
• Julia: A Fresh Approach to Numerical Computing
• The university of Florida sparse matrix collection
• Semirings for social networks analysis

This page was built for publication: Algebraic Algorithms for Betweenness and Percolation Centrality