A Dominating Set Algorithm

Abstract

This paper proposes a linear-time algorithm that has been designed to obtain an accurate solution for Dominating Set (DS) problem, which is known to be NP-complete due to the deficiency of polynomial-time algorithms that successfully derive an accurate solution to it. The proposed algorithm does so by repeatedly assigning vertex  with maximum degree among vertices adjacent to the vertex  with minimum degree  to Minimum Independent DS (MIDS) as its element and removing all the incident edges until no edges remain in the graph. This algorithm finally transforms MIDS into Minimum DS (MDS) and again into Minimum Connected DS (MCDS) so as to obtain the accurate solution to all DS-related problems. When applied to ten different graphs, it has successfully obtained accurate solutions with linear time complexity . It has therefore proven that Dominating Set problem is rather a P-problem.▸Keywords : Dominating Set, Connected DS, Independent DS, Degree•제1저자 : 이상운