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...
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: | |
Online Access: | https://ieeexplore.ieee.org/document/9446072/ |
Similar Items
-
Network dismantling on factor graphs: break long loops and spare local structures
by: Tianyi Li
Published: (2021-01-01) -
On the Rate of Convergence of Greedy Algorithms
by: Vladimir Temlyakov
Published: (2023-06-01) -
Entropy-Based Greedy Algorithm for Decision Trees Using Hypotheses
by: Mohammad Azad, et al.
Published: (2021-06-01) -
A Functional Characterization of Almost Greedy and Partially Greedy Bases in Banach Spaces
by: Pablo Manuel Berná, et al.
Published: (2021-08-01) -
Network Higher-Order Structure Dismantling
by: Peng Peng, et al.
Published: (2024-03-01)