Maximum independent sets

Several datasets containing a numerical study done to compare three different algorithms. Aim of the study was to see which algorithms output the largest maximal independent sets. To compare to the exact solution we have calculated a maximum independent set for various graph sizes and connection probabilities. We have done this for the following graph types:

• Erdos-renyi graphs;
• Random bipartite graphs;
• Random geometric graphs.