Hello everyone! Can anyone give me a clue how to make polynomial reduction of hamiltonian cycle problem to maximal clique problem? I've googled a lot, but all I've found is that the two problems are obviously equal. Not so obvious for me though. Corman's "Algorithms" wasn't helpful either.
Name:
Anonymous2011-06-20 12:01
If you are still looking for the answer, i might be able to help.
If you found the answer then please post it here ok? ^^
Name:
a2011-06-20 12:02
If you are still looking for the answer, i might be able to help.
If you found the answer then please post it here ok? ^^
Name:
a2011-06-20 12:02
If you are still looking for the answer, i might be able to help.
If you found the answer then please post it here ok? ^^
Name:
a2011-06-20 12:02
If you are still looking for the answer, i might be able to help.
If you found the answer then please post it here ok? ^^
Name:
Anonymous2011-06-25 11:25
For problem A all we care about is the probability that the other 2 children are girls which .5*.5=.25
It looks like for problem b we saw another child which was a girl (since we don't know whether or not it was the first girl it must be a girl) assuming an equal probabilty to observe each child there is a 1/3 chance the girl we saw was the original one and a 2/3 chance it was another one.
In the case that it is the child the same probability applies (.25)
In the other case there is only one more child to be accounted for so the probability of all girls is 1/2