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

ACM Transactions on Mathematical Software

Volumn 25, Issue 3, 1999, Pages 341-352

  Ribeiro, Celso C ^a   Resende, Mauricio G C ^b  

^a PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Automatic graph drawing; Combinatorial optimization; Graph planarization; GRASP; Local search

Indexed keywords

EID: 0001725090     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/326147.326153     Document Type: Article

References (14)

1. CAI, J., HAN, X., AND TARJAN, R. E. 1993. An O(m log n)-time algorithm for the maximal planar subgraph problem. SIAM J. Comput. 22, 6 (Dec. 1993), 1142-1162.
2. DI BATTISTA, G. AND TAMASSIA, R. 1989. Incremental planarity testing. In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science (FOCS '89, Research Triangle Park, NC, Oct. 30-Nov. 1) IEEE Computer Society Press, Los Alamitos, CA, 436-441.
3. FEO, T. AND RESENDE, M. 1995. Greedy randomized adaptive search procedures. J. Global Optim. 6, 109-133.
4. GAVRIL, F. 1973. Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks 3, 261-273.
5. GOLDSCHMIDT, O. AND TAKVORIAN, A. 1994. An efficient graph planarization two-phase heuristic. Networks 24, 69-73.
6. GOLUMBIC, M. 1980. Algorithmic Graph Theory and Perfect Graphs. Academic Press, Inc., New York, NY.
7. HOPCROFT, J. AND TARJAN, R. 1974. Efficient planarity testing. J. ACM 21, 4 (Oct.), 549-568.
8. 2) algorithms for graph planarization. IEEE Trans. Comput.-Aided Des. 8, 257-267.
9. JÜNGER, M. AND MUTZEL, P. 1996. Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica 16, 33-59.
10. LEMPEL, A., EVEN, S., AND CEDARBAUM, I. 1966. An algorithm for planarity testing of graphs. In Proceedings of the International Symposium on Theory of Graphs (Rome) Gordon and Breach Science Publishers, Inc., Langhorn, PA, 215-232.
11. LIU, P. AND GELDMACHER, R. 1977. On the deletion of nonplanar edges of a graph. In Proceedings of the 10th Southeastern Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL) 727-738.
12. RESENDE, M. G. C. AND RIBEIRO, C. C. 1997. A GRASP for graph planarization. Networks 29, 173-189.
13. SARRAFZADEH, M. AND LEE, D. 1989. A new approach to topological via minimization. IEEE Trans. Comput.-Aided Des. 8, 890-900.
14. TAKEFUJI, Y. AND LEE, K. 1989. A near-optimum parallel planarization algorithm. Science 245, 1221-1223.