On the Complexity of Approximating Colored-Graph Problems

Andrea E. F. Clementi, Pierluigi Crescenzi, Gianluca Rossi. On the Complexity of Approximating Colored-Graph Problems. In COCOON. pages 281-290, 1999. [doi]

@inproceedings{ClementiCR99,
  title = {On the Complexity of Approximating Colored-Graph Problems},
  author = {Andrea E. F. Clementi and Pierluigi Crescenzi and Gianluca Rossi},
  year = {1999},
  url = {http://link.springer.de/link/service/series/0558/bibs/1627/16270281.htm},
  tags = {graph-rewriting, e-science, rewriting},
  researchr = {https://researchr.org/publication/ClementiCR99},
  cites = {0},
  citedby = {0},
  pages = {281-290},
  booktitle = {COCOON},
}