Algorithm 797

Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP. We describe Fortran subroutines for finding approximate solutions of the maximum planar subgraph problem (graph planarization) using a Greedy Randomized Adaptive Search Procedure (GRASP). The design and implementation of the code are described in detail. Computational results with the subroutines illustrate the quality of solutions found as a function of number of GRASP iterations.

This software is also peer reviewed by journal TOMS.