Is this an NP complete problem?
formyfamilyandgoodfriend_at_yahoo.com.cn
Date: 12/13/03
- Next message: Alex Simpson: "CFP: LICS 2004: 2nd Call"
- Previous message: Craig Feinstein: "Re: Question: the modern/state-of-the-art P?=NP research"
- Next in thread: Bruce Harvey: "Re: Is this an NP complete problem?"
- Reply: Bruce Harvey: "Re: Is this an NP complete problem?"
- Reply: Richard J Kinch: "Re: Is this an NP complete problem?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Sat, 13 Dec 2003 01:52:58 GMT
Dear Sir/Madam,
Given an undirected graph, every edge in it will be in a specific
color. For example, there are 4 lines in the graph. Two lines are red.
One line is yellow. Another line is blue. Then there are totally 3
kinds of colors in this graph. I further assume there are n cut sets
in the graph. In one cut set, the lines are either red or yellow. So
there are 2 kinds of color in this cut set.
With the definition stated above, my objective is to find a cut set
that contains the least kinds of colors. I am wondering if this
problem is an NP complete problem.
Thanks a lot for your attention and look forward to your advice!
Best regards,
Helen
- Next message: Alex Simpson: "CFP: LICS 2004: 2nd Call"
- Previous message: Craig Feinstein: "Re: Question: the modern/state-of-the-art P?=NP research"
- Next in thread: Bruce Harvey: "Re: Is this an NP complete problem?"
- Reply: Bruce Harvey: "Re: Is this an NP complete problem?"
- Reply: Richard J Kinch: "Re: Is this an NP complete problem?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|