Abstract
For any graph G with fixed boundary there exists a layout in the plane, which minimizes the maximum Euclidean distance of any node to its neighbors. This layout balances the length of the graph edges and is therefore called a (length-) balanced layout of G . Furthermore the existence of a unique optimal balanced layout L with the following properties is proved: (i) L is the minimal element of an order defined on the set of layouts of a graph with fixed boundary. (ii) L may be constructed as the limit of the l p -optimal layouts L p of G . (iii) If G is a planar graph with fixed boundary, then the optimal balanced layout L of G is quasi-planar.
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.
