Graphs hard-to-process for greedy algorithm MIN

We compare results of selected algorithms that approximate the independence number in terms of the quality of constructed solutions. Furthermore, we establish smallest hard-to-process graphs for the greedy algorithm Min.