Scholarlink

This paper presents a degree based fixed order deterministic algorithm for the maximum independent set problem on large-scale graphs in a single iteration. We compare our proposed algorithm with existing heuristic as well as meta-heuristic algorithms. The algorithms are tested on the various DIMACS10 benchmark datasets and miscellaneous benchmark datasets. Results show that our proposed algorithm outperforms other compared algorithms.

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

Degree-Oriented Deterministic Approach for Maximum Independent Set

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Ritika Verma,
  • Shubham Jaswal,
  • Abhay,
  • Dharmendra Prasad Mahato

摘要

This paper presents a degree based fixed order deterministic algorithm for the maximum independent set problem on large-scale graphs in a single iteration. We compare our proposed algorithm with existing heuristic as well as meta-heuristic algorithms. The algorithms are tested on the various DIMACS10 benchmark datasets and miscellaneous benchmark datasets. Results show that our proposed algorithm outperforms other compared algorithms.