[igraph] maximum number of independent sets

[harun pirim]

Hi All, 

I know that it is linear time to find the maximum number of independent sets (MNOIS) in over a tree.

I have a tree with around 3000 nodes. I want to find MNOIS.

I tried independence.number(.), and independent.vertex.sets(.). Looks like takes a lot of time. Is there a way in R using igraph lib. to efficiently calculate the MNOIS or minimum vertex cover?

Thank you,

Harun Pirim

Ph.D. Candidate

Miss. State Univ.

Ind. & Sys. Eng.