1 paper
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…