Browse State-of-the-Art › Approximating Betweenness-Centrality ranking
Approximating Betweenness-Centrality ranking
2 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28
Betweenness-centrality is a popular measure in network analysis that aims to describe the importance of nodes in a graph. It accounts for the fraction of shortest paths passing through that node and is a key measure in many applications including community detection and network dismantling.
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
No dataset record in the archive lists this task.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Most implemented papers archive 2025-07-28
2 shown of 2 papers with code (2 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
1 May 2023 1 repository listedTo validate the effectiveness of the proposed centrality measure, it is compared with classic measures, such as Degree, Closeness, Betweenness, PageRank, and other measures based on the gravity model, effective distance…
-
6 Sep 2021 1 repository listedIt accounts for the fraction of shortest paths passing through that node and is a key measure in many applications including community detection and network dismantling.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections