Dismantling Networks by Skeleton Extraction and Greedy Tree Breaking

Dismantling Networks by Skeleton Extraction and Greedy Tree Breaking

Network dismantling is one of the important NP-hard problems in the field of social network analysis. It aims to break down networks into many small components of limited size by only removing a small group of nodes. One feasible way is to decycle (eliminating all the cycles) the network first and t...

Full description

Bibliographic Details
Main Authors: Xiaobin Rui, Fanrong Meng, Yahui Chai, Zhixiao Wang, Philip S. Yu
Format: Article
Language:English
Published: IEEE 2021-01-01
Series:IEEE Access
Subjects:
Network dismantling
network skeleton
acyclic graph
greedy tree breaking
approximation algorithm
Online Access:https://ieeexplore.ieee.org/document/9446072/

Internet

https://ieeexplore.ieee.org/document/9446072/

Similar Items