yes exactly what i was looking for, this looks way too simple :) maybe
thats why i couldnt figure it out
thank you!
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group,
ok, can anybody indicate an algorithm that would verify if there exists
a set of k independent vertices in a graph ?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group,
your problem is a typical NPcomplete problem
and no polynomial algorithm is possible.
the link you provide just calculates maximal independent set, not
maximum independent set. It turns out this two can be totally
different.
Ken1 wrote:
I've been trying to do this for a while and now I give up,
