Maximal Independent Set is an algorithm that finds the maximal set of vertexs which has no adjacent between each others. For this vertexs set, there is no edge connecting each two, and the size of the vertex set is different by different method.