no code implementations • 3 Jan 2023 • Niels Gleinig, Tal Ben-Nun, Torsten Hoefler
We can only process data that is stored in fast memory, which incurs data movement (input/output-operations, or I/Os) between the two units.
2 code implementations • 4 Jan 2018 • Xiao-Long Ren, Niels Gleinig, Dirk Helbing, Nino Antulov-Fantulin
In this paper, we introduce the generalized network dismantling problem, which aims to find the set of nodes that, when removed from a network, results in a network fragmentation into subcritical network components at minimum cost.
Social and Information Networks Statistical Mechanics Physics and Society Computation
no code implementations • 10 Oct 2017 • Xiao-Long Ren, Niels Gleinig, Dijana Tolic, Nino Antulov-Fantulin
Finally, for the case when it is possible to attack links, we propose a simple and efficient edge removal strategy named Hierarchical Power Iterative Normalized cut (HPI-Ncut). The results on real and artificial networks show that the HPI-Ncut algorithm outperforms all the node removal and link removal attack algorithms when the cost of the attack is taken into consideration.
