24 citations · 48 across the 15 of their papers we have counts for
3 papers · 1 filter
Computing top-k Closeness Centrality Faster in Unweighted Graphs
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi +2
Given a connected graph , the closeness centrality of a vertex is defined as . This measure is widely used in the analysis of real-w…
Sigil3D: A Crowdsourcing Platform for Interactive 3D Content
Andrea Barillari, Daniele Bernardini, Pierluigi Crescenzi
In this paper we propose applying the crowdsourcing approach to a software platform that uses a modern and state-of-the-art 3D game engine. This platform could facilitate the gener…
Improving the betweenness centrality of a node by adding links
Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo +3
Betweenness is a well-known centrality measure that ranks the nodes according to their participation in the shortest paths of a network. In several scenarios, having a high between…