sentence1: because obtaining the mis of a basic graph is np complete , we adopt the minimum degree greedy algorithm to approximate the mis .
sentence2: since obtaining the mis of a general graph is np-complete , we adopt the minimum-degree greedy algorithm to approximate the maximum independent set .