Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP

被引：8
|
作者：
Ribeiro, C [1 ]
Resende, MGC
机构：
[1] Pontificia Univ Catolica Rio de Janeiro, Dept Comp Sci, BR-22453900 Rio De Janeiro, Brazil
[2] AT&T Labs Res, Florham Park, NJ 07932 USA
来源：
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE | 1999年 / 25卷 / 03期
关键词：
automatic graph drawing; combinatorial optimization; graph planarization; GRASP; local search;
D O I：
10.1145/326147.326153
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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.
引用
收藏
页码：341 / 352
页数：12
相关论文
共 50 条
12345