187 citations · 581 across the 39 of their papers we have counts for
Showing 2019 · cs.DSShow all
2 papers · 2 filters
cs.DS2019
Local Search for Group Closeness Maximization on Big Graphs
Eugenio Angriman, Alexander van der Grinten, Henning Meyerhenke
In network analysis and graph mining, closeness centrality is a popular measure to infer the importance of a vertex. Computing closeness efficiently for individual vertices receive…
cs.DS2019
Group Centrality Maximization for Large-scale Graphs
Eugenio Angriman, Alexander van der Grinten, Aleksandar Bojchevski +3
The study of vertex centrality measures is a key aspect of network analysis. Naturally, such centrality measures have been generalized to groups of vertices; for popular measures i…