114 citations · 229 across the 12 of their papers we have counts for
12 papers
Network reconstruction from asynchronously updated evolutionary game
Hong-Li Zeng, Shu-Xuan Wang, Yan-Dong Guo +1
The interactions between players of prisoner's dilemma (PD) game are reconstructed with evolutionary game data. All participants play the game with their counterparts and gain corr…
Two-distance minimal dominating set problem studied by statistical mechanics and simulated annealing
Yusupjan Habibulla, Shao-meng Qin
The L-distance (especially the 2-distance) minimal dominating set (MDS) problem is widely considered in various dominating set problems. Recently, we studied the regular dominating…
Spin-glass model for the C-dismantling problem
Shao-Meng Qin
C-dismantling (CD) problem aims at finding the minimum vertex set D of a graph G(V,E) after removing which the remaining graph will break into connected components with the size no…
Dismantle a network efficiently during the entire process by a compound algorithm
Shao-Meng Qin
The dismantling network problem only asks the minimal vertex set of a graph after removing which the remaining graph will break into connected components of sub-extensive size, but…
Spin glass phase transitions in the random feedback vertex set problem
Shao-Meng Qin, Ying Zeng, Hai-Jun Zhou
A feedback vertex set (FVS) of an undirected graph contains vertices from every cycle of this graph. Constructing a FVS of sufficiently small cardinality is very difficult in the w…
Solving the undirected feedback vertex set problem by local search
Shao-Meng Qin, Hai-Jun Zhou
An undirected graph consists of a set of vertices and a set of undirected edges between vertices. Such a graph may contain an abundant number of cycles, then a feedback vertex set…