XPost: comp.graphics.algorithms, comp.theory, sci.math   
   XPost: sci.op-research   
   From: emarkp@soda.csua.berkeley.edu   
      
   In article ,   
   formyfamilyandgoodfriend@yahoo.com.cn    
   wrote:   
   >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.   
      
   The graph with no edges will have 0 colors.  Perhaps you   
   underspecified the problem?  What is the difference between colors and   
   "kinds of colors"?  What are *all* of the requirements on the output   
   (obviously what you provided is only one of the requirements)?   
   --   
   Mark Ping   
   emarkp@soda.CSUA.Berkeley.EDU   
      
   [ 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)