Re: Is this an NP complete problem?

In article <[EMAIL PROTECTED]>,
[EMAIL PROTECTED] <[EMAIL PROTECTED]> 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                     
[EMAIL PROTECTED]

[ comp.ai is moderated.  To submit, just post and be patient, or if ]
[ that fails mail your article to <[EMAIL PROTECTED]>, and ]
[ ask your news administrator to fix the problems with your system. ]