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 条
  • [21] Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures
    Kpodjedo, Segla
    Galinier, Philippe
    Antoniol, Giulio
    EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2010, 6022 : 119 - 130
  • [22] An Approximate Solution of some Variational Problems Using Boubaker Polynomials
    Ouda, Eman Hassan
    BAGHDAD SCIENCE JOURNAL, 2018, 15 (01) : 106 - 109
  • [23] ON APPROXIMATE SOLUTION OF FREE BOUNDARY PROBLEMS USING FINITE DIFFERENCES
    CRYER, CW
    JOURNAL OF THE ACM, 1970, 17 (03) : 397 - &
  • [24] A Solution to Graph Coloring Problem Using Genetic Algorithm
    Malhotra, Karan
    Vasa, Karan D.
    Chaudhary, Neha
    Vishnoi, Ankit
    Sapra, Varun
    EAI ENDORSED TRANSACTIONS ON SCALABLE INFORMATION SYSTEMS, 2024, 11 (06):
  • [25] Solution of SAT problems with the adaptive-bias quantum approximate optimization algorithm
    Yu, Yunlong
    Cao, Chenfeng
    Wang, Xiang -Bin
    Shannon, Nic
    Joynt, Robert
    PHYSICAL REVIEW RESEARCH, 2023, 5 (02):
  • [26] Asymptotically optimal approach to the approximate solution of several problems of covering a graph by m nonadjacent cycles
    Gimadi, E. Kh
    Rykov, I. A.
    TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2015, 21 (03): : 89 - 99
  • [27] Comparison of Explicit Method of Solution for CFD Euler Problems using MATLAB® and FORTRAN 77
    Nordli, A.
    Khawaja, H.
    INTERNATIONAL JOURNAL OF MULTIPHYSICS, 2019, 13 (02) : 203 - 214
  • [28] A new primal-dual algorithm for multilabel graph-cuts problems with approximate moves
    Cheng, Ziang
    Liu, Yang
    Liu, Guojun
    COMPUTER VISION AND IMAGE UNDERSTANDING, 2017, 165 : 75 - 84
  • [29] APPROXIMATE SOLUTION OF BOUNDARY VALUE PROBLEMS USING SHIFTED LEGENDRE POLYNOMIALS
    Khalil, Hammad
    Shah, Kamal
    Khan, Rahmat Ali
    APPLIED AND COMPUTATIONAL MATHEMATICS, 2017, 16 (03) : 269 - 285
  • [30] Numerical algorithm for approximate solution of the third - order differential equation with boundary value problems
    Li, Ping
    Niu, Jing
    INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS & STATISTICS, 2014, 52 (06): : 137 - 144
12345