A greedy approach to solve maximum independent set problem: Differential Malatya independent set algorithm
In this study, a method has been plant pot developed for solving the maximum independent set problem, which is one of the significant problems in graph theory.The maximum independent set problem is NP-hard for all types of graphs.The proposed method features a robust and greedy approach that produces results in polynomial time for all graph types.T