A faster approximate method to identify minimum dominating set

The minimum dominating set (MDS) problem is known to be NP-hard. Compared with the currently fastest extract algorithm for MDS problem on graphs of n vertices using O(2
^0.59n
)time, which could merely tackle these problems with 200 vertices scale in 8 hours, the paper presents a faster approximate layer-method to address MDS problems in O(n
²
) time and the method is proved to be effective particularly for larger scale MDS. Furthermore, the programing phases are shown in detail.