1 citations · 3 across the 11 of their papers we have counts for
1 paper · 1 filter
Alexander Kolpakov, Igor Rivin
Computing classical centrality measures such as betweenness and closeness is computationally expensive on large-scale graphs. In this work, we introduce an efficient force layout a…