Dismantling Efficiency and Network Fractality

26 Apr 2018 Im Yoon Seok Kahng B.

Network dismantling is to identify a minimal set of nodes whose removal breaks the network into small components of subextensive size. Because finding the optimal set of nodes is an NP-hard problem, several heuristic algorithms have been developed as alternative methods, for instance, the so-called belief propagation-based decimation (BPD) algorithm and the collective influence (CI) algorithm... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • PHYSICS AND SOCIETY
  • SOCIAL AND INFORMATION NETWORKS