Finding large planar subgraphs and large subgraphs of a given genus

  • Gruia Călinescu
  • Cristina G. Fernandes
Session 5
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1090)


We consider the MAXIMUM PLANAR SUBGRAPH problem — given a graph G, find a largest planar subgraph of G. This problem has applications in circuit layout, facility layout, and graph drawing. We improve to 4/9 the best known approximation ratio for the MAXIMUM PLANAR SUBGRAPH problem. We also consider a generalization of the previous problem, the MAXIMUM GENUS D SUBGRAPH problem — given a connected graph G, find a maximum subgraph of G of genus at most D. For the latter problem, we present a simple algorithm whose approximation ratio is 1/4.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CFFK96]
    G. Călinescu, C. G. Fernandes, U. Finkler and H. Karloff, “A Better Approximation Algorithm for Finding Planar Subgraphs”, Proc. 7th Annual ACM-SIAM Symp. on Discrete Algorithms, 1996.Google Scholar
  2. [CN85]
    N. Chiba and T. Nishizeki, “Arboricity and Subgraph Listing Algorithms”, SIAM Journal of Computing, 14:210–223, 1985.Google Scholar
  3. [F92]
    L. R. Foulds, Graph Theory Applications, Springer-Verlag, New York, 1992.Google Scholar
  4. [GS85]
    H. N. Gabow and M. Stallmann, “Efficient Algorithms for Graphic Matroid Intersection and Parity”, Automata, Language and Programming: 12th Collog., Lecture Notes in Computer Science, Vol. 194, 210–220, 1985.Google Scholar
  5. [LG77]
    P. C. Liu and R. C. Geldmacher, “On the Deletion of Nonplanar Edges of a Graph”, Proc. 10th Southeastern Conference on Combinatorics, Graph Theory, and Computing, 727–738, 1977.Google Scholar
  6. [LP86]
    L. Lovász and M. D. Plummer, Matching Theory, Elsevier Science, Amsterdam, 1986.Google Scholar
  7. [TDB88]
    R. Tamassia, G. Di Battista and C. Batini, “Automatic Graph Drawing and Readability of Diagrams”, IEEE Transactions on Systems, Man and Cybernetics, 18:61–79, 1988.Google Scholar
  8. [Th89]
    C. Thomassen, “The Graph Genus Problem is NP-Complete”, Journal of Algorithms, 10:568–576, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Gruia Călinescu
    • 1
  • Cristina G. Fernandes
    • 1
  1. 1.College of ComputingGeorgia Institute of TechnologyAtlantaUSA

Personalised recommendations