XPost: comp.graphics.algorithms, comp.theory, sci.math   
   XPost: sci.op-research   
   From: gwoegi@figipc56.tu-graz.ac.at   
      
   In comp.theory formyfamilyandgoodfriend@yahoo.com.cn  wrote:   
   # Hi,   
   #   
   # Could you give me some suggestions on this problem? Thanks for your   
   # time and attention first.   
   #   
   # The problem I am thinking is as follows:   
   #   
   # Given an undirected graph. Every edge in this graph will be in a   
   # specific color. Now I want to find a subset of edges that contains the   
   # least kinds of colors.   
   #   
   # Is it an NP complete problem?   
      
   No, probably not.   
      
   Just take the empty set (in polynomial time).   
   It contains zero colors, and it will be hard   
   to find something better.   
      
      
      
   # Finally thanks a lot for your time and attention once again.   
   #   
   # Best regards,   
   # Helen   
   #   
      
      
      
   --Gerhard   
      
      
   __________________________________________________________________   
   Gerhard J. Woeginger   http://wwwhome.cs.utwente.nl/~woegingergj/   
      
   [ comp.ai is moderated.  To submit, just post and be patient, or if ]   
   [ that fails mail your article to , and ]   
   [ ask your news administrator to fix the problems with your system. ]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)