Abstract
Given an n-vertex outerplanar graph G, the problem is considered of arranging the vertices of G on a line so that no two edges cross and various cost measures are minimized. Efficient algorithms are presented for generating layouts in which every edge (i, j) and of G does not exceed a given bandwidth b(i, j), and the total edge length and the cutwidth of the layout are minimized. Characterizations of optimal layouts used by the algorithms are given. The algorithms combine sublayouts by solving two processor-scheduling problems. Although these scheduling problems are generally NP-complete, the instances generated by the algorithms are polynomial in n. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
