180 citations · 1.1k across the 47 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cond-mat.dis-nn2021★ 10 cited
Cycle-tree guided attack of random K-core: Spin glass model and efficient message-passing algorithm
Hai-Jun Zhou
The K-core of a graph is the maximal subgraph within which each vertex is connected to at least K other vertices. It is a fundamental network concept for understanding threshold ca…
cs.SI2021★ 10 cited
Minimum Long-Loop Feedback Vertex Set and Network Dismantling
Tianyi Li, Pan Zhang, Hai-Jun Zhou
Network dismantling aims at breaking a network into disconnected components, and attacking vertices that intersect with many loops has proven to be a most efficient strategy. But t…