Re: Is this an NP complete problem?
formyfamilyandgoodfriend_at_yahoo.com.cn
Date: 12/18/03
- Next message: formyfamilyandgoodfriend_at_yahoo.com.cn: "Re: Is this an NP complete problem?"
- Previous message: Machine Learning for Signal Processing 2004 : "Machine Learning for Signal Processing 2004"
- In reply to: Bruce Harvey: "Re: Is this an NP complete problem?"
- Next in thread: Richard J Kinch: "Re: Is this an NP complete problem?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: 17 Dec 2003 18:15:39 -0800
Dear Sir/Madam,
I truely feel shame when I read your reply. I am very grateful to it.
Thanks for your words.
Best regards,
Helen
"Bruce Harvey" <newsforbruce@bearsoft..co.uk> wrote in message news:<3fdaed91$1@news2.power.net.uk>...
> Hi,
>
> For a peasant like me, this is undefined. All I can imagine an undirected
> graph to be is a piece of squared paper with two axes and a line floaing
> throught the air.
>
> But more seriously, are you talking about a four sided figure (curved lines
> allowed)
>
> No because then it would be possible to make a straight cut through 3 or
> even four lines.
>
> Or you could be talking about 4 parallel lines.
>
>
> Please, the art of maths is to write it so that those of all specialisatons
> can understand it, otherwise for all we know, you may be two memebers of a
> mutual admiration society talking gibberish so you will appear cleaver.
>
>
> Adding
>
> Formal Definition: A graph G is a pair (V,E), where V is a set of vertexes,
> and E is a set of edges between the vertexes E = {{u,v} | u, v V}. If the
> graph does not allow self-loops, adjacency is irreflexive, that is E =
> {{u,v} | u, v V u v}.
>
> and saying a cut partitions the set of vertices would help tose who have not
> been to the lectures.
>
>
>
> We must all be aware that new maths is being created far faster than any one
> person can read it and that maths degree sylibi contain only a very small
> subset of all that is maths.
>
>
>
>
> --
> regards Bruce
>
> Bruce Harvey
> bruce@bearsoft.co.uk
> The Alternative Physics Site
> http://users.powernet.co.uk/bearsoft
>
>
>
>
>
>
> <formyfamilyandgoodfriend@yahoo.com.cn> wrote in message
> news:8bd15ecd.0312102136.e68eee9@posting.google.com...
> > 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
> >
>
>
> begin 666 member.gif
> M1TE&.#=A"0`+`( ``````/___RP`````"0`+```"#XR/J<" OI1I[4!Y5Y4<
> #%0`[
> `
> end
>
> begin 666 wedge.gif
> M1TE&.#EA!P`(`( ``````/___R'Y! $```$`+ `````'``@```(,C&&)J,'>
> (X)'J'>L*`#L`
> `
> end
>
> begin 666 neq.gif
> M1TE&.#EA"@`*`/ ``/___P```"'Y! $`````+ `````*``H```(2A ^!&+KF
> .7CNMV@A?9M<RG3P%`#L`
> `
> end
- Next message: formyfamilyandgoodfriend_at_yahoo.com.cn: "Re: Is this an NP complete problem?"
- Previous message: Machine Learning for Signal Processing 2004 : "Machine Learning for Signal Processing 2004"
- In reply to: Bruce Harvey: "Re: Is this an NP complete problem?"
- Next in thread: Richard J Kinch: "Re: Is this an NP complete problem?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|
