On Fri, Jul 20, 2012 at 8:37 AM, Tamás Nepusz <[email protected]> wrote: [...] > As for an efficient algorithm to generate all the undirected connected graphs > of a given size, this paper looks promising (although I cannot access it):
Also, keep in mind, that even an "efficient" algorithm will never really be efficient, because you'll need to generate exponentially many graphs. Gabor [...] -- Gabor Csardi <[email protected]> MTA KFKI RMKI _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
