1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.DS2017
Faster Betweenness Centrality Updates in Evolving Networks
Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann +1
Finding central nodes is a fundamental problem in network analysis. Betweenness centrality is a well-known measure which quantifies the importance of a node based on the fraction o…
cs.CG2016★ 1 cited
A Sparse Stress Model
Mark Ortmann, Mirza Klimenta, Ulrik Brandes
Force-directed layout methods constitute the most common approach to draw general graphs. Among them, stress minimization produces layouts of comparatively high quality but also im…