D S ] 1 2 D ec 2 00 5 The Linear Arrangement Problem Parameterized Above Guaranteed Value

@inproceedings{Gutin2008DS,
  title={D S ] 1 2 D ec 2 00 5 The Linear Arrangement Problem Parameterized Above Guaranteed Value},
  author={Gregory Gutin and Arash Rafiey and Stefan Szeider and Anders Yeo},
  year={2008}
}
A linear arrangement (LA) is an assignment of distinct integers to the vertices of a graph. The cost of an LA is the sum of lengths of the edges of the graph, where the length of an edge is defined as the absolute value of the difference of the integers assigned to its ends. For many application one hopes to find an LA with small cost. However, it is a… CONTINUE READING