Skip to main content
SpringerLink
Log in

Finding large planar subgraphs and large subgraphs of a given genus

  • Session 5
  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1090))

Included in the following conference series:

  • 166 Accesses

Abstract

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.

Research supported in part by NSF grant CCR-9319106.

Research supported in part by CNPq (Brazil), under contract 200975/92-7.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. N. Chiba and T. Nishizeki, “Arboricity and Subgraph Listing Algorithms”, SIAM Journal of Computing, 14:210–223, 1985.

    Google Scholar 

  3. L. R. Foulds, Graph Theory Applications, Springer-Verlag, New York, 1992.

    Google Scholar 

  4. 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. 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. L. Lovász and M. D. Plummer, Matching Theory, Elsevier Science, Amsterdam, 1986.

    Google Scholar 

  7. 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. C. Thomassen, “The Graph Genus Problem is NP-Complete”, Journal of Algorithms, 10:568–576, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computing, Georgia Institute of Technology, 30332-0280, Atlanta, GA, USA

    Gruia Călinescu & Cristina G. Fernandes

Authors
  1. Gruia Călinescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cristina G. Fernandes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jin-Yi Cai Chak Kuen Wong

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Călinescu, G., Fernandes, C.G. (1996). Finding large planar subgraphs and large subgraphs of a given genus. In: Cai, JY., Wong, C.K. (eds) Computing and Combinatorics. COCOON 1996. Lecture Notes in Computer Science, vol 1090. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61332-3_148

Download citation

  • DOI: https://doi.org/10.1007/3-540-61332-3_148

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61332-9

  • Online ISBN: 978-3-540-68461-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation