Network dismantling on factor graphs: break long loops and spare local structures
A new solution framework for the task of network dismantling is recently developed, based on a two-scale bipartite factor-graph representation of the original graph where local structures are abstracted as factor nodes. This technique leads to advancement of extant dismantling algorithms, among whic...
Main Author: | Tianyi Li |
---|---|
Format: | Article |
Language: | English |
Published: |
IOP Publishing
2021-01-01
|
Series: | New Journal of Physics |
Subjects: | |
Online Access: | https://doi.org/10.1088/1367-2630/ac28ca |
Similar Items
-
Dismantling Networks by Skeleton Extraction and Greedy Tree Breaking
by: Xiaobin Rui, et al.
Published: (2021-01-01) -
The existence of a graph whose vertex set can be partitioned into a fixed number of strong domination-critical vertex-sets
by: Weisheng Zhao, et al.
Published: (2024-01-01) -
Unexpectedly high levels and health risks of atmospheric polychlorinated biphenyls in modern mechanical dismantling of obsolete electrical equipment: Investigations in a large integrated e-waste dismantling industrial estate
by: Jingnan Li, et al.
Published: (2023-12-01) -
An Investigation of Corona Domination Number for Some Special Graphs and Jahangir Graph
by: L. Praveenkumar, et al.
Published: (2023-03-01) -
On the chromatic number of graphs with some restriction of vertex degrees
by: S.N. Selezneva
Published: (2020-12-01)