Maximum Independent Set Using Hummingbird Optimization
摘要
The Maximum Independent Set problem in distributed systems is an NP-hard problem. This paper uses a soft computing approach to solve this problem. In this paper, we use Hummingbird Optimization to solve the problem. We also compare the proposed algorithm with deterministic algorithm, non-deterministic algorithms and other soft computing algorithms. We tested the algorithms on DIMACS benchmark datasets.