7 citations · 16 across the 8 of their papers we have counts for
Showing cs.SIShow all
3 papers · 1 filter
cs.SI2024
Introducing Total Harmonic Resistance for Graph Robustness under Edge Deletions
Lukas Berner, Henning Meyerhenke
Assessing and improving the robustness of a graph are critical steps in network design and analysis. To this end, we consider the optimisation problem of removing edges fro…
cs.SI2023
Greedy Optimization of Resistance-based Graph Robustness with Global and Local Edge Insertions
Maria Predari, Lukas Berner, Robert Kooij +1
The total effective resistance, also called the Kirchhoff index, provides a robustness measure for a graph . We consider two optimization problems of adding new edges to …
cs.SI2016
Generating realistic scaled complex networks
Christian L. Staudt, Michael Hamann, Alexander Gutfraind +2
Research on generative models is a central project in the emerging field of network science, and it studies how statistical patterns found in real networks could be generated by fo…