An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
From MaRDI portal
Publication:5131226
DOI10.7155/jgaa.00543zbMath1446.05085arXiv1802.06701OpenAlexW3096671981MaRDI QIDQ5131226
Matthias Bentert, André Nichterlein, Alexander J. Dittmann, Rolf Niedermeier, Leon Kellerhals
Publication date: 5 November 2020
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.06701
Related Items (7)
Towards classifying the polynomial-time solvability of temporal betweenness centrality ⋮ Data Reduction for Maximum Matching on Real-World Graphs ⋮ Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality ⋮ The stochastic pseudo-star degree centrality problem ⋮ Finding temporal paths under waiting time constraints ⋮ Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments ⋮ Parameterized complexity of diameter
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast approximation of betweenness centrality through sampling
- The power of linear-time data reduction for maximum matching
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs
- A faster algorithm for betweenness centrality*
- Betweenness Centrality – Incremental and Faster
- On Tractable Cases of Target Set Selection
- Emergence of Scaling in Random Networks
- Randomized adaptive sorting
- Dynamic Merging of Frontiers for Accelerating the Evaluation of Betweenness Centrality
- Topology manipulations for speeding betweenness centrality computation
- Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
- Better Approximation of Betweenness Centrality
- Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter
- Approximating Betweenness Centrality
- Networks
This page was built for publication: An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
