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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
