Finding Innovative and Efficient Solutions to NP-Hard and NP-Complete Problems in Graph Theory

Authors : Ali Karci

Pages : 137-143

View : 13 | Download : 8

Publication Date : 2020-12-01

Article Type : Research

Abstract :It is known that there are many NP-hard and NP-complete problems in graph theory. The aim of this paper to prepare some basic methods for solving such problems (min dominating set, max independent set, max clique, etc.). In order to construct such fundamentals, the effectiveness and ineffectiveness of all nodes in the given graph are computed. Then these values will be used in solving NP-Hard problems of graphs.
Keywords : Dominating Sets, Fundamental Cut-Sets, Efficient Algorithms, Independent Sets, Maximum Clique