Abstract
A linear-time algorithm is presented to recognize and embed rectilinear graphs which are embeddable on the plane. Previously, only the O( n 2) time algorithm of Viyajan and Wigderson (1985) was known. The algorithm described here uses a different and surprisingly simple strategy.
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.
