[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Question on generating connected graphs
|
From: |
Gábor Csárdi |
|
Subject: |
Re: [igraph] Question on generating connected graphs |
|
Date: |
Fri, 20 Jul 2012 17:09:10 -0400 |
On Fri, Jul 20, 2012 at 8:37 AM, Tamás Nepusz <address@hidden> 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 <address@hidden> MTA KFKI RMKI