3 citations · 5 across the 6 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020
Group-Harmonic and Group-Closeness Maximization -- Approximation and Engineering
Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo +3
Centrality measures characterize important nodes in networks. Efficiently computing such nodes has received a lot of attention. When considering the generalization of computing cen…
cs.DS2020
Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis
Eugenio Angriman, Maria Predari, Alexander van der Grinten +1
The ubiquity of massive graph data sets in numerous applications requires fast algorithms for extracting knowledge from these data. We are motivated here by three electrical measur…