Key points are not available for this paper at this time.
The Maximum Independent Set (MaxIS) problem is a well-known NP-hard problem. This paper presents a fixed order configuration deterministic algorithm that improves complexities by achieving a time complexity of O(m+nlogn), which simplifies to O(nlogn) for sparse graphs and O(n2) for dense graphs. Experimental results in DIMACS and other benchmark datasets confirm that our algorithm not only delivers faster execution, but also maintains high solution quality, making it a superior choice for large-scale MaxIS problems.
Verma et al. (Mon,) studied this question.