Finding a maximum independent set is a fundamental NP-hard problem  . Given an unweighted graph, this problem asks for a maximum cardinality set of pairwise non-adjacent vertices.
<meaning-changed> Finding a maximum independent set is a fundamental NP-hard problem  . Given an unweighted graph, this problem asks for a maximum cardinality set of pairwise non-adjacent vertices.
Finding a maximum independent set is a fundamental NP-hard problem that is used in many real-world applications . Given an unweighted graph, this problem asks for a maximum cardinality set of pairwise non-adjacent vertices.