This problem is taken from www.codeforces.com.What can be the possible
approaches??
A smile house is created to raise the mood. It has *n* rooms. Some of the
rooms are connected by doors. For each two rooms (number *i*and *j*), which
are connected by a door, Petya knows their value *c**ij* — t
Consider each person as a node on a graph. Two nodes are connected only when
both persons like each other.
Now do any traversal of this graph to find the number of connected
components. That should be the minimum no. of houses required.
On Sun, May 29, 2011 at 9:17 PM, ross wrote:
> There are n
it is exactly a graph coloring problem. so it has no polynomial order
solution.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
al
There are n persons.
You are provided with a list of ppl which each person does not like.
Determine the minm no. of houses required such that, in no house
2 people should dislike each other.
Is there a polynomial time solution exist for this? Or is this not
solvable at all?
--
You received this
Hello!
We have a graph that is not directional. We want an algorithm to find
out if this graph is divided to two parts or not.
mofid
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post
