Abstract
Planar Graph Problems. Classical and recent results are surveyed in the development of efficient algorithms for the following eleven famous problems on planar graphs: planarity testing, embedding, drawing, separators, vertex-coloring, independent vertex set, listing subgraphs, Hamiltonian cycle, network flows, and Steiner trees and forests. Also typical methods and techniques useful for computational problems on planar graphs are discussed. Furthermore open questions on planar graphs are mentioned.
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.
