Yuri Gurevich, Larry J. Stockmeyer, Uzi Vishkin. Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems. Journal of the ACM, 31(3):459-473, 1984. [doi]
@article{GurevichSV84,
title = {Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems},
author = {Yuri Gurevich and Larry J. Stockmeyer and Uzi Vishkin},
year = {1984},
doi = {10.1145/828.322439},
url = {http://doi.acm.org/10.1145/828.322439},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/GurevichSV84},
cites = {0},
citedby = {0},
journal = {Journal of the ACM},
volume = {31},
number = {3},
pages = {459-473},
}