Abstract
Abstract We present a linear-time algorithm that, given an n -vertex planar graph G , finds an embedding of G into a (2 n − 4) × ( n − 2) grid such that the edges of G are straight-line segments.
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.
