Skip to main content
SpringerLink
Log in

Hardness of approximating graph transformation problem

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1994)

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

Included in the following conference series:

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. S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness of aproximate optima in lattices, codes, and systems of linear equations. In Proc. 34th FOCS, pages 724–733, 1993.

    Google Scholar 

  2. T. Asano and T. Hirata. Edge-deletion and edge-contraction problems. In Proc. 14th STOC, pages 245–254, 1982.

    Google Scholar 

  3. A. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of aproximation problems. In Proc. 33rd FOCS, pages 14–23, 1992.

    Google Scholar 

  4. A. Condon, J. Feigenbaum, C. Lund, and P. Shor. Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. In Proc. 25th STOC, pages 305–314, 1993.

    Google Scholar 

  5. M. R. Garey and D. S. Johnson. Computers and Intractability, A Guide to The Theory of NP-Completeness. W. H. Freeman and Company, 1979.

    Google Scholar 

  6. J. E. Hopcroft and J. Wong. Linear time algorithm for isomorphism of planar graphs. In Proc. Sixth STOC, pages 172–184, 1974.

    Google Scholar 

  7. J. M. Lewis and M. Yannakakis. The node-deletion problem for hereditary properties is NP-complete. JCSS, 20:219–230, 1980.

    Google Scholar 

  8. C. Lund and M. Yannakakis. The approximation of maximum subgraph problems. In ICALP 93, pages 40–51, 1993.

    Google Scholar 

  9. C. Lund and M. Yannakakis. On the hardness of approximating maximization problems. In Proc. 25th STOC, pages 286–293, 1993.

    Google Scholar 

  10. C. H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. JCSS, 43:425–440, 1991.

    Google Scholar 

  11. U. Schöning. Graph isomorphism is in the low hierarchy. In 4th STACS, pages 114–124. Lecture Notes in Computer Science 247, Springer-Verlag, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, State University of New York at Stony Brook, 11794-4400, Stony Brook, NY, USA

    Chih-Long Lin

Authors
  1. Chih-Long Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Xiang-Sun Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, CL. (1994). Hardness of approximating graph transformation problem. In: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_168

Download citation

  • DOI: https://doi.org/10.1007/3-540-58325-4_168

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58325-7

  • Online ISBN: 978-3-540-48653-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation