36 citations · 96 across the 8 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015★ 8 cited
Fast and Simple Computation of Top-k Closeness Centralities
Michele Borassi, Pierluigi Crescenzi, Andrea Marino
Closeness is an important centrality measure widely used in the analysis of real-world complex networks. In particular, the problem of selecting the k most central nodes with respe…
physics.soc-ph2015★ 36 cited
Hyperbolicity Measures "Democracy" in Real-World Networks
Michele Borassi, Alessandro Chessa, Guido Caldarelli
We analyze the hyperbolicity of real-world networks, a geometric quantity that measures if a space is negatively curved. In our interpretation, a network with small hyperbolicity i…