It is not vertex cover but an edge covering we are interested in. Sorry
I have been out of touch with graphs for quite some time.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to
this one might have some optimal substructure, though it's not
exactly clear what that may be. I'll give it some thought.
On Dec 1, 6:26 am, smartdude [EMAIL PROTECTED] wrote:
Reading about hamming distance and clustering methods might help
Reading about hamming distance and clustering methods might help.
bullockbefriending bard wrote:
A single 6 Pick bet looks like this:
RACE1 RACE2RACE3RACE4 RACE5 RACE6
runner1 / runner 2 / runner 3 / runner4 / runner5 / runner6 - $amount
e.g. we might have:
5 / 3 / 11 / 7
Check out:
http://en.wikipedia.org/wiki/UUID
Arunachalam wrote:
Look at one way hashing algorithms. Which can map a password to some byte
keys.
I think MD5 will solve your purpose. But collisions are possible in MD5.
http://en.wikipedia.org/wiki/MD5
regards
Arunachalam.
On 11/2/06,
Pseudocode:
1. Choose a pivot element from amongst the elements in the arrays.
2. Partition each array into sets with elements lesser and greater than
the pivot element.
3. Compute the rank of the pivot element by adding the number of
elements lesser than the pivot in each of the arrays. If the
