Statistical mechanics of the directed 2-distance minimal dominating set problem

Yusupjan Habibulla

Figure 4. BPD, RS and greedy algorithm results for the D-2MDS problem on the ER random graph with a size of N = 104 nodes. The BPD and greedy algorithm results are obtained on five ER random graphs that include N = 104 nodes. The x-axis denotes the The arc density α while and y-axis denotes the energy density. Inverse temperature β = 10.0.