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.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Maximum Independent Set Using Hummingbird Optimization

  • Ritika Verma,
  • Dharamendra Prasad Mahato

摘要

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.