Computing Betweenness Centrality in Link Streams
From MaRDI portal
Publication:6107025
DOI10.7155/jgaa.00620zbMath1518.05182arXiv2102.06543OpenAlexW3129250346MaRDI QIDQ6107025
Matthieu Latapy, Clémence Magnien, Frédéric Simard
Publication date: 3 July 2023
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.06543
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Enumeration in graph theory (05C30) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality, Computing Betweenness Centrality in Link Streams
Cites Work
- Unnamed Item
- Scalable computational techniques for centrality metrics on temporally detailed social network
- Graphs, dioids and semirings. New models and algorithms.
- Algebraic structures for dynamic networks
- Towards classifying the polynomial-time solvability of temporal betweenness centrality
- A faster algorithm for betweenness centrality*
- A Guide to Temporal Networks
- Community structure in social and biological networks
- Algebraic Algorithms for Betweenness and Percolation Centrality
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Complex Networks
- Computing Betweenness Centrality in Link Streams