Hardness of Approximating Graph Transformation Problem

Chih-Long Lin. Hardness of Approximating Graph Transformation Problem. In Ding-Zhu Du, Xiang-Sun Zhang, editors, Algorithms and Computation, 5th International Symposium, ISAAC 94, Beijing, P. R. China, August 25-27, 1994, Proceedings. Volume 834 of Lecture Notes in Computer Science, pages 74-82, Springer, 1994.

@inproceedings{Lin94:11,
  title = {Hardness of Approximating Graph Transformation Problem},
  author = {Chih-Long Lin},
  year = {1994},
  tags = {graph transformation, graph-rewriting, rewriting, transformation},
  researchr = {https://researchr.org/publication/Lin94%3A11},
  cites = {0},
  citedby = {0},
  pages = {74-82},
  booktitle = {Algorithms and Computation, 5th International Symposium, ISAAC  94, Beijing, P. R. China, August 25-27, 1994, Proceedings},
  editor = {Ding-Zhu Du and Xiang-Sun Zhang},
  volume = {834},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-58325-4},
}