Hi, Is there an easy way to find one instance of an independent set of a certain size in a graph (using the Python implementation)?
largest_independent_vertex_sets() gives me all of them, but I know what the largest size is in my problem, I just need to find one of them. If I find them all, then the algorithm takes too long. Breaking after the first instance might save me enough time to make this implementation usable. Thank you for the help. _______________________________________________ igraph-help mailing list igraph-help@nongnu.org https://lists.nongnu.org/mailman/listinfo/igraph-help
