A greedy approach to solve maximum independent set problem: Differential Malatya independent set algorithm
In this study, a method has been 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 result...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2025-03-01
|
| Series: | Engineering Science and Technology, an International Journal |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2215098625000503 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|