The unreleased 0.6 version of igraph has a much faster implementation for this, you can download a nightly build source R package from here: https://code.google.com/p/igraph/downloads/list
Make sure that you download the right file, there are C, Python packages there as well. I can send you a windows binary package, if you are using windows. Note that in this version vertices and edges are numbered from one and not from zero, so you might need to update your code. Best Regards, Gabor On Tue, Jun 12, 2012 at 11:58 AM, Diogo Alagador <alaga...@isa.utl.pt> wrote: > I am using the igraph package and I would like to obtain only 1 largest > independent set from a sparse graph with aprox. 600 vertices. When I used > the largest.independent.vertex.sets command I cannot obtain all the sets in > a decent time, even if I need only 1. Any ideas on how to solve this? > > Thanks in advance, > Diogo Alagador > Biodiversity Chair, Univ Évora, Portugal > > ______________________________________________ > R-help@r-project.org mailing list > https://stat.ethz.ch/mailman/listinfo/r-help > PLEASE do read the posting guide http://www.R-project.org/posting-guide.html > and provide commented, minimal, self-contained, reproducible code. -- Gabor Csardi <csa...@rmki.kfki.hu> MTA KFKI RMKI ______________________________________________ R-help@r-project.org mailing list https://stat.ethz.ch/mailman/listinfo/r-help PLEASE do read the posting guide http://www.R-project.org/posting-guide.html and provide commented, minimal, self-contained, reproducible code.
