3 citations · 5 across the 6 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
Fully-dynamic Weighted Matching Approximation in Practice
Eugenio Angriman, Henning Meyerhenke, Christian Schulz +1
Finding large or heavy matchings in graphs is a ubiquitous combinatorial optimization problem. In this paper, we engineer the first non-trivial implementations for approximating th…
cs.DS2021
New Approximation Algorithms for Forest Closeness Centrality -- for Individual Vertices and Vertex Groups
Alexander van der Grinten, Eugenio Angriman, Maria Predari +1
The emergence of massive graph data sets requires fast mining algorithms. Centrality measures to identify important vertices belong to the most popular analysis methods in graph mi…