|igraph Reference Manual|
int igraph_maximal_independent_vertex_sets(const igraph_t *graph, igraph_vector_ptr_t *res);
A maximal independent vertex set is an independent vertex set which can't be extended any more by adding a new vertex to it.
The algorithm used here is based on the following paper: S. Tsukiyama, M. Ide, H. Ariyoshi and I. Shirawaka. A new algorithm for generating all the maximal independent sets. SIAM J Computing, 6:505--517, 1977.
The implementation was originally written by Kevin O'Neill and modified by K M Briggs in the Very Nauty Graph Library. I simply re-wrote it to use igraph's data structures.
If you are interested in the size of the largest independent vertex set,
The input graph.
Pointer to a pointer vector, the result will be stored
Time complexity: TODO.