Colorwave? This seems a rather obscure algorithm for maximum independent set (that is, if it is actually an algorithm for the max independent set). Also, minimum dominating set and maximum independent set are not the same problem (they are not equivalent problems). You might want to be a little more careful when defining classical problems -- if, for some reason, you feel compelled to do so.
On Feb 5, 2:20 am, "Rupesh Bhochhi" <[EMAIL PROTECTED]> wrote: > Robin, > > You are use colorwave algorithm to solve the problem. In fact this > type of problem is call Minimum Connected Dominating Set or Minimum > Independent Set where no two adjacent vertices are filled with the > same color. > > On Feb 5, 2008 1:04 AM, robin <[EMAIL PROTECTED]> wrote: > > > > > Hello > > > I came across the following problem which i am unable to solve : > > > Given a Graph G. we have to find the minimum number of vertices that > > should be colored so that each vertex is > > > either colored or has a neighbouring vertex which is colored. > > > Please help --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
