Fig. 3
From: A social network graph partitioning algorithm based on double deep Q-Network

(a) The number of cut edges of the three algorithms on different datasets. (b) The load balance degree of the three algorithms on different datasets.
From: A social network graph partitioning algorithm based on double deep Q-Network

(a) The number of cut edges of the three algorithms on different datasets. (b) The load balance degree of the three algorithms on different datasets.