60 citations · 199 across the 10 of their papers we have counts for
Showing cond-mat.stat-mechShow all
2 papers · 1 filter
cond-mat.stat-mech2006★ 60 cited
Message passing for vertex covers
Martin Weigt, Haijun Zhou
Constructing a minimal vertex cover of a graph can be seen as a prototype for a combinatorial optimization problem under hard constraints. In this paper, we develop and analyze mes…
cond-mat.stat-mech2003
Vertex cover problem studied by cavity method: Analytics and population dynamics
Haijun Zhou
We study the vertex cover problem on finite connectivity random graphs by zero-temperature cavity method. The minimum vertex cover corresponds to the ground state(s) of a proposed…