본문 바로가기
  • Home

Maximum Degree Vertex Domatic Set Algorithm for Domatic Number Problem

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2015, 20(2), pp.63-70
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Sang-Un, Lee 1

1강릉원주대학교

Accredited

ABSTRACT

In the absence of a polynomial time algorithm capable of obtaining the exact solutions to it, the domaticnumber problem (DNP) of dominating set (DS) has been regarded as NP-complete. This paper suggestspolynomial-time complexity algorithm about DNP. In this paper, I select a vertex vi of the maximumdegree (ΔG) as an element of a dominating set Dv,i =1,2, ⋯k , compute Di+1 from a simplified graph of Vi+1= Vi╲Di, and verify that Di is indeed a dominating set through V╲Di = NG(Di) . When applied to 15various graphs, the proposed algorithm has succeeded in bringing about exact solutions withpolynomial-time complexity O(kn) . Therefore, the proposed domatic number algorithm shows that thedomatic number problem is in fact a P-problem.

Citation status

* References for papers published after 2023 are currently being built.