Abstract
In this paper, we introduce a new heuristic algorithm for finding maximum planar subgraphs of a graph. Our algorithm is based on the simulated annealing optimization scheme. We compare the quality of the solutions and running times of our algorithm with greedy randomized adaptive search procedure (GRASP) and branch-and-cut heuristics. We show that simulated annealing is an efficient method to find planar subgraphs with a large number of edges. The algorithm clearly outperforms earlier heuristic algorithms; it is faster and its solution quality is better. The algorithm is very simple, although it needs an implementation for the planarity test.
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.
