Thank you for the reply. I have not searched on your hints yet, but
here is a clarification.
could you please explain your problem more in detail?
Sure. Here is a very simple example of what I am trying to do. Say I
have a graph given by...
Node 1:
neighbor of 2, distance=1
neighbor
So I am trying to do a literature search, but am unsure of the name of
the problem. I have a graph with edges weighted according to euclidean
seperations of nodes (magnitudes only, no directional information). I
am trying to convert this information into a n-dimensional space
embedding (not
Cyril,
This is a good resource for any problem...
http://www.cs.sunysb.edu/~algorith/
...and specifically for yours...
http://www.cs.sunysb.edu/~algorith/files/vertex-coloring.shtml
Hope this helps.
Zach
Cyril misc wrote:
Thank you very much for all your help.
I wish you a very Happy
Yes, this is very different from what I was imagining. You use the
word permutation many times when I think you mean combination. A
permutation assigns some sort of meaning to the order in which they
elements are chosen.
I think you pretty much have a solution in the bag. A recursive
