Layouts with wires of balanced length
- Cite this paper as:
- Becker B., Osthof H.G. (1985) Layouts with wires of balanced length. In: Mehlhorn K. (eds) STACS 85. STACS 1985. Lecture Notes in Computer Science, vol 182. Springer, Berlin, Heidelberg
For any graph (with fixed boundary) there exists a layout, which minimizes the maximum distance of any node to its neighbours. This layout balances the length of the wires (corresponding to graph edges) and is called (length-) balanced layout.
L is the minimal element of an order defined on the set of layouts of a graph with fixed boundary.
L may be constructed as the limit of the 1p-optimal layouts Lp of G.
If G is a planar graph with fixed boundary, then the optimal balanced layout L of G is ‘quasi-planar’.
Unable to display preview. Download preview PDF.