Layouts with wires of balanced length

  • B. Becker
  • H. G. Osthof
Conference paper

DOI: 10.1007/BFb0023991

Part of the Lecture Notes in Computer Science book series (LNCS, volume 182)
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

Abstract

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.

Furthermore the existence of a unique ‘optimal’ balanced layout L with the following properties is proved:
  1. i)

    L is the minimal element of an order defined on the set of layouts of a graph with fixed boundary.

     
  2. ii)

    L may be constructed as the limit of the 1p-optimal layouts Lp of G.

     
  3. iii)

    If G is a planar graph with fixed boundary, then the optimal balanced layout L of G is ‘quasi-planar’.

     

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1985

Authors and Affiliations

  • B. Becker
    • 1
  • H. G. Osthof
    • 1
  1. 1.Fachbereich 10Universität des SaarlandesSaarbrückenWest Germany

Personalised recommendations