Maximizing the reduction ability for near-maximum independent set computation

Finding the maximum independent set is a fundamental NP-hard problem in graph theory. Recent studies have paid much attention to designing efficient algorithms that find a maximal independent set o...