XPost: comp.graphics.algorithms, comp.theory, sci.math   
   XPost: sci.op-research   
      
   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?   
      
   Finally thanks a lot for your time and attention once again.   
      
   Best regards,   
   Helen   
      
   [ 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)