8 citations · 14 across the 5 of their papers we have counts for
5 papers
Long-range frustration in minimal vertex cover problem on random graphs
Yu-Tao Li, Chun-Yan Zhao, Jin-Hua Zhao
A vertex cover on a graph is a set of vertices in which each edge of the graph is adjacent to at least one vertex in the set. The minimal vertex cover (MVC) problem concerns findin…
Buffon-Laplace Needle Problem as a geometric probabilistic approach to filtration process
Yan-Jie Min, De-Quan Zhu, Jin-Hua Zhao
Buffon-Laplace Needle Problem considers a needle of a length randomly dropped on a large plane distributed with vertically parallel lines with distances and ($a \geqsla…
Random node reinforcement and -core structure of complex networks
Rui Ma, Yanqing Hu, Jin-Hua Zhao
To enhance robustness of complex networked systems, a simple method is introducing reinforced nodes which always function during failure propagation. A random scheme of node reinfo…
A residual-based message passing algorithm for constraint satisfaction problems
Chun-Yan Zhao, Yan-Rong Fu, Jin-Hua Zhao
Message passing algorithms, whose iterative nature captures well complicated interactions among interconnected variables in complex systems and extracts information from the fixed…
A local algorithm and its percolation analysis of bipartite -matching problem
Jin-Hua Zhao
A -matching on a bipartite graph is a set of edges, among which each vertex of two types of the graph is adjacent to at most and at most () edges, respectiv…