Skip to main content
SpringerLink
Log in

Graph Planarization

  • Reference work entry
Encyclopedia of Optimization

  • 146 Accesses

Article Outline

Keywords

Variants and Applications

An Exact Algorithm

Heuristics Based on Planarity Testing

Two-Phase Heuristics

Computational Results

See also

References

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Angluin D, Valiant LG (1979) Probabilistic algorithms for Hamiltonian circuits and matchings. J Comput Syst Sci 18:155–190

    Article  MathSciNet  MATH  Google Scholar 

  2. Booth K, Lueker G (1976) Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J Comput Syst Sci 13:335–379

    MathSciNet  MATH  Google Scholar 

  3. Cai J, Han X, Tarjan R (1993) An O(m log n)-time algorithm for the maximal planar subgraph problem. SIAM J Comput 22:1142–1162

    Article  MathSciNet  MATH  Google Scholar 

  4. Chiba T, Nishioka I, Shirakawa I (1979) An algorithm of maximal planarization of graphs. In: Proc. 1979 IEEE Symp. Circuits and Sys., pp 649–652

    Google Scholar 

  5. Cimikowski RJ (1995) An analysis of heuristics for the maximum planar subgraph problem. In: Proc. 6th ACM-SIAM Symp. Discrete Algorithms, pp 322–331

    Google Scholar 

  6. Di Battista G, Eades P, Tamassia R, Tollis IG (1994) Algorithms for drawing graphs: An annotated bibliography. Comput Geom Th Appl 1:235–282

    Article  MathSciNet  Google Scholar 

  7. Di Battista G, Tamassia R (1989) Incremental planarity testing. Proc. 30th IEEE Symp. FOCS, pp 436–441

    Google Scholar 

  8. Eades P, Foulds LR, Giffin JW (1982) An efficient heuristic for identifying a maximum weight planar subgraph. In: Lecture Notes Math, vol 952. Springer, Berlin, pp 239–251

    Google Scholar 

  9. Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Global Optim 6:109–133

    Article  MathSciNet  MATH  Google Scholar 

  10. Foulds LR, Robinson RW (1976) A strategy for solving the plant layout problem. Oper Res Quart 27:845–855

    Article  MathSciNet  MATH  Google Scholar 

  11. Foulds LR, Robinson RW (1978) Graph theoretic heuristics for the plant layout problem. Internat J Production Res 16:27–37

    Article  Google Scholar 

  12. Goldschmidt O, Takvorian A (1994) An efficient graph planarization two-phase heuristic. Networks 24:69–73

    Article  MathSciNet  MATH  Google Scholar 

  13. Hasan M, Osman IH (1995) Local search algorithms for the maximal planar layout problem. Internat Trans Oper Res 2:89–106

    Article  MATH  Google Scholar 

  14. Hopcroft J, Tarjan RE (1974) Efficient planarity testing. J ACM 21:549–568

    Article  MathSciNet  MATH  Google Scholar 

  15. Jünger M, Leipert S, Mutzel P (1998) A note on computing a maximal planar subgraph using PQ-trees. Techn Report Inst Informatik Univ Köln 98.320

    Google Scholar 

  16. Jünger M, Mutzel P (1996) Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica 16:33–59

    Article  MathSciNet  MATH  Google Scholar 

  17. Laguna M, Marti R (1999) GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS J Comput 11:44–52

    Article  MATH  Google Scholar 

  18. Lempel A, Even S, Cedarbaum I (1966) An algorithm for planarity testing of graphs. Proc. Theory of Graphs Internat. Symp. Gordon and Breach, New York, pp 215–232

    Google Scholar 

  19. Lengauer T (1990) Combinatorial algorithms for integrated circuit layout. Wiley, New York

    MATH  Google Scholar 

  20. Leung J (1992) A new graph-theoretic heuristic for facility layout. Managem Sci 38:594–605

    MATH  Google Scholar 

  21. Liu PC, Geldmacher RC (1977) On the deletion of nonplanar edges of a graph. In: Proc. 10th SE Conf. Comb., Graph Theory, and Comput., pp 727–738

    Google Scholar 

  22. Resende MGC, Ribeiro CC (1997) A GRASP for graph planarization. Networks 29:173–189

    Article  MATH  Google Scholar 

  23. Ribeiro CC, Resende MGC (1999) Algorithm 797: FORTAN subroutines for approximate solution of graph planarization problems using GRASP. ACM Trans Math Softw 25:341–352

    Article  MATH  Google Scholar 

  24. Stoer M (1992) Design of survivable networks. Lecture Notes Math, vol 1531. Springer, Berlin

    MATH  Google Scholar 

  25. Takefuji Y, Lee KC (1989) A near-optimum parallel planarization algorithm. Science 245:1221–1223

    Article  Google Scholar 

  26. Takefuji Y, Lee K-C, Cho YB (1991) Comments on an O(n2)algorithm for graph planarization. IEEE Trans Computer-Aided Design 10:1582–1583

    Article  Google Scholar 

  27. Tamassia R, DiBattista G (1988) Automatic graph drawing and readability of diagrams. IEEE Trans Syst, Man Cybern 18:61–79

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Sci. Res., AT&T Labs Res., Florham Park, USA

    Mauricio G.C. Resende

  2. Department Computer Sci., Catholic University Rio de Janeiro, Rio de Janeiro, Brazil

    Celso C. Ribeiro

Authors
  1. Mauricio G.C. Resende
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Celso C. Ribeiro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Resende, M.G., Ribeiro, C.C. (2008). Graph Planarization . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_254

Download citation

Publish with us

Policies and ethics

Search

Navigation