180 citations · 1.1k across the 47 of their papers we have counts for
9 papers · 1 filter
Feedback arcs and node hierarchy in directed networks
Jin-Hua Zhao, Hai-Jun Zhou
Directed networks such as gene regulation networks and neural networks are connected by arcs (directed links). The nodes in a directed network are often strongly interwound by a hu…
Fast and simple decycling and dismantling of networks
Lenka Zdeborová, Pan Zhang, Hai-Jun Zhou
Decycling and dismantling of complex networks are underlying many important applications in network science. Recently these two closely related problems were tackled by several heu…
Optimal Disruption of Complex Networks
Jin-Hua Zhao, Hai-Jun Zhou
The collection of all the strongly connected components in a directed graph, among each cluster of which any node has a path to another node, is a typical example of the intertwini…
Covering Problems and Core Percolations on Hypergraphs
Bruno Coelho Coutinho, Hai-Jun Zhou, Yang-Yu Liu
Covering problems are classical computational problems concerning whether a certain combinatorial structure 'covers' another. For example, the minimum vertex covering problem aims…
A spin glass approach to the directed feedback vertex set problem
Hai-Jun Zhou
A directed graph (digraph) is formed by vertices and arcs (directed edges) from one vertex to another. A feedback vertex set (FVS) is a set of vertices that contains at least one v…
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…