IndependenceNumber returns the cardinality of a largest independent set of the graph G. This is equal to the CliqueNumber of the complement of G. MaximumIndependentSet returns a list of vertices comprising a maximum independent set of G. The strategy is a branch-and-bound backtracking algorithm using the greedy color bound (see Kreher and Stinson, 1999).