Planar linear arrangements of outerplanar graphs

G.N. Frederickson, S.E. Hambrusch
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
more » ... ts by solving two processor scheduling problems. Although these scheduling problems are NP-complete in general. the insrances generated by our algorithms are polynomial in n.
doi:10.1109/31.1745 fatcat:nffllelyrbanjcuhkaop4lliom