Ok, i've understood; you're problem is related to the one of drawing
planar graphs (is it correct?).
I can't tell you ('cause i don't know) a proper algorithm but you might
find it useful to look at this:
http://www.graphviz.org/Theory.php
at least to have an idea of what the problem is then
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
Hi,
could you please explain your problem more in detail?
What is your problem, optimization? It is related with the embedding of
finite metrics over finite graph? That is, what do you mean with
euclidean separation of nodes? Something like w(i, j) is the distance
between Rome and Venice or w(i,
