A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Planar linear arrangements of outerplanar graphs
1988
IEEE Transactions on Circuits and Systems
Given an n -vertex outerplanar graph G I we consider the problem of arranging the vertices of G on a line such that no two edges cross and various cost measures are minimized. We present efficient algorithms for generating layouts in which every edge (i ,j) of G does not exceed a given bandwidth b (i ,n, the total edge length and the cutwidth of the layout is minimized. respectively. We present characterizations of oplimallayollts which are used by the algorithms. Our algorithms combine
doi:10.1109/31.1745
fatcat:nffllelyrbanjcuhkaop4lliom