New Algorithms for Minimum Dominating Set in Any Graphs

Authors : Ali Karci

Pages : 62-70

View : 14 | Download : 8

Publication Date : 2020-12-01

Article Type : Research

Abstract :There are many NP-hard and NP-complete problems in graph theory. The aim of this paper is to solve minimum dominating set problem which is an NP-hard and NP-Complete problem. At this aim, there is a new type spanning tree for given graph, and the fundamental cut-sets of graph are constructed by using this spanning tree. The cut-sets and spanning tree constitute the basic building blocks for algorithms will be proposed in this study.
Keywords : Dominating Sets, Fundamental Cut-Sets, Efficient Algorithms