Efficient Algorithms for Determining the Maximum Independent Sets in Graphs

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Bilgisayar Bilimleri
Volume:5 Issue:2
Efficient Algorithms for Determining the Maximum Independent Sets in Graphs

Efficient Algorithms for Determining the Maximum Independent Sets in Graphs

Authors : Ali KARCİ

Pages : 144-149

View : 12 | Download : 6

Publication Date : 2020-12-01

Article Type : Research Paper

Abstract :It is known that there are many NP-hard and NP-complete problems in graph theory. The aim of this paper to solve the maximum independent set which is an NP-Hard and NP-Complete problem. In order to solve maximum independent set for given graph, a special spanning tree which is defined in this paper for the first time, is solved to obtain the fundamental cut-sets. The fundamental cut-sets are used to determine the effects of nodes. These effects of nodes are used to determine the elements of maximum independent set.
Keywords : Spanning Tree, Fundamental Cut Sets, Efficient Algorithms, Effects of Nodes

ORIGINAL ARTICLE URL

VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.