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.
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.
Primary Language | English |
---|---|
Subjects | Software Testing, Verification and Validation |
Journal Section | PAPERS |
Authors | |
Publication Date | December 1, 2020 |
Submission Date | May 30, 2020 |
Acceptance Date | June 23, 2020 |
Published in Issue | Year 2020 Volume: 5 Issue: 2 |
The Creative Commons Attribution 4.0 International License is applied to all research papers published by JCS and
A Digital Object Identifier (DOI) is assigned for each published paper.