11 citations · 20 across the 3 of their papers we have counts for
3 papers
cs.CC2014★ 2 cited
Organization mechanism and counting algorithm on Vertex-Cover solutions
Wei Wei, Renquan Zhang, Baolong Niu +2
Counting the solution number of combinational optimization problems is an important topic in the study of computational complexity, especially on the #P-complete complexity class.…
math-ph2012★ 7 cited
Analysis on the evolution process of BFW-like model with explosive percolation of multiple giant components
Renquan Zhang, Wei Wei, Binghui Guo +2
Recently, the modified BFW model on random graph [Phys. Rev. Lett., 106, 115701 (2011)], which shows a strongly discontinuous percolation transition with multiple giant components,…
math-ph2011★ 11 cited
Determining the Solution Space of Vertex-Cover by Interactions and Backbones
Wei Wei, Renquan Zhang, Binghui Guo +1
To solve the combinatorial optimization problems especially the minimal Vertex-cover problem with high efficiency, is a significant task in theoretical computer science and many ot…