Module 797 in TOMS

General Information

GMPSG: Approximate solution of the maximum planar subgraph problem (graph planarization) using a greedy randomized adaptive search procedure (GRASP). (See C.C. Ribeiro and M.G.C. Resende, ACM TOMS 25 (1999) pp. 341-352).

Classification

G2d	Network optimization

Type

subroutine in TOMS package

Language

Fortran

Availability

Some uses prohibited, Portable

Precision

Single Precision

Download from NETLIB; Public access repository

Location

The University of Tennessee at Knoxville and Bell Laboratories

Contact

Jack Dongarra, ORNL (dongarra@cs.utk.edu) and Eric Grosse, Bell Labs (ehg@research.att.com)