Algebraic algorithms for betweenness and percolation centrality

DOI10.7155/JGAA.00558MaRDI QIDQ4994345zbMATH OpenOpenAlexFDO

Authors Altansuren Tumurbaatar, Matthew J. Sottile

Publication date 17 June 2021

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

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

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

Recommendations

• An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
• A faster algorithm for betweenness centrality*
• Dynamic merging of frontiers for accelerating the evaluation of betweenness centrality
• Efficient algorithms for game-theoretic betweenness centrality
• Betweenness centrality -- incremental and faster

Cites work

• A faster algorithm for betweenness centrality*
• Graphs, dioids and semirings. New models and algorithms.
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 5937963 (Why is no real title available?)
• Julia: a fresh approach to numerical computing
• Semirings for social networks analysis
• The University of Florida sparse matrix collection

Cited in

(3)

• An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
• Computing Betweenness Centrality in Link Streams
• Linear-algebraic implementation of Fibonacci heap

Describes a project that uses

Uses Software

• NetworkX
• SparseMatrix
• Julia
• Numba

This page was built for publication: Algebraic algorithms for betweenness and percolation centrality

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