labelling vertices in a graph in an optimal way problem

43 Views Asked by At

given a set of n points in the plane and a set S of non ordered pairs of integers from 1 to n. if i label all the points with the numbers from 1 to n, i can considered the set S the edges of a graph. How can i efficiently found a labelling of the points such that the sum of the length of the edges is minimal?

1

There are 1 best solutions below

0
On

In other words, you want to embed the graph in the plane, with each node corresponding to one of the specified points, in a way that minimizes the total edge length. This is an instance of the quadratic assignment problem. The flow for pairs in $S$ is $1$, and the flow for pairs of points not in $S$ is $0$.