Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs-Reference-Cited by-同舟云学术

Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs

Published:2018 Issue: Volume: Page:752-764
ISSN:0302-9743
Container-title:Advances in Knowledge Discovery and Data Mining
language:
Short-container-title:

Author:

Chehreghani Mostafa Haghir,Bifet Albert,Abdessalem Talel

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-93040-4_59

Reference22 articles.

1. Agarwal, M., Singh, R.R., Chaudhary, S., Iyengar, S.: Betweenness ordering problem: an efficient non-uniform sampling technique for large graphs. CoRR abs/1409.6470 (2014)

2. Borassi, M., Natale, E.: KADABRA is an adaptive algorithm for betweenness via random approximation. In: 24th European Symposium on Algorithms, pp. 1–18 (2016)

3. Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25(2), 163–177 (2001)

4. Brandes, U., Pich, C.: Centrality estimation in large networks. Int. J. Bifurcat. Chaos 17(7), 303–318 (2007)

5. Çatalyürek, Ü.V., Kaya, K., Sariyüce, A.E., Saule, E.: Shattering and compressing networks for betweenness centrality. In: SDM, pp. 686–694 (2013)

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Betweenness centrality approximation in large networks using shortest paths approximation and adaptive sampling;International Conference on Internet of Things and Machine Learning (IoTML 2023);2023-11-29

2. Estimation and update of betweenness centrality with progressive algorithm and shortest paths approximation;Scientific Reports;2023-10-10

3. Bavarian: Betweenness Centrality Approximation with Variance-aware Rademacher Averages;ACM Transactions on Knowledge Discovery from Data;2023-03-06

4. A Dynamic and Task-Independent Reward Shaping Approach for Discrete Partially Observable Markov Decision Processes;Advances in Knowledge Discovery and Data Mining;2023

5. On Using Node Indices and Their Correlations for Fake Account Detection;2022 IEEE International Conference on Big Data (Big Data);2022-12-17