44 citations · 72 across the 7 of their papers we have counts for
8 papers
Minimum Connected Dominating Set and Backbone of a Random Graph
Yusupjan Habibulla, Hai-Jun Zhou
We study the minimum dominating set problem as a representative combinatorial optimization challenge with a global topological constraint. The requirement that the backbone induced…
Statistical Mechanics of the L-Distance Minimal Dominating Set problem
Yusupjan Habibulla
Statistical mechanics is widely applied to solve hard optimization problem, the optimal strategy related to ground state energy that depends on low temperature. Common thermodynami…
Statistical Mechanics of the Directed 2-distance Minimal Dominating Set problem
Yusupjan Habibulla
The directed L-distance minimal dominating set (MDS) problem has wide practical applications in the fields of computer science and communication networks. Here, we study this probl…
Two-distance minimal dominating set problem studied by statistical mechanics and simulated annealing
Yusupjan Habibulla, Shao-meng Qin
The L-distance (especially the 2-distance) minimal dominating set (MDS) problem is widely considered in various dominating set problems. Recently, we studied the regular dominating…
Minimal Dominating Set problem studied by simulated annealing and cavity method: Analytics and population dynamics
Yusupjan Habibulla
The minimal dominating Set (MDS) problem is a prototypical hard combinatorial optimization problem. Two years ago we studied this problem by cavity method. Although we get the solu…
The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation
Yusupjan Habibulla, Jin-Hua Zhao, Hai-Jun Zhou
A minimum dominating set for a digraph (directed graph) is a smallest set of vertices such that each vertex either belongs to this set or has at least one parent vertex in this set…
Statistical Mechanics of the Minimum Dominating Set Problem
Jin-Hua Zhao, Yusupjan Habibulla, Hai-Jun Zhou
The minimum dominating set problem has wide applications in network science and related fields. It consists of assembling a node set of global minimum size such that any node of th…
CCCP Algorithms to Minimize the Bethe free energy of 3-SAT Problem
Yusupjan Habibulla
The k-sat problem is a prototypical constraint satisfaction problem. There are many algorithms to study k-sat problem, BP algorithm is famous one of them. But BP algorithm does not…