activity
20132022
most citedEffectiveness of pre- and inprocessing for CDCL-based SAT solving

5 citations · 7 across the 7 of their papers we have counts for

collaborators
Showing 2021Show all

1 paper · 1 filter

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…