Arvind Gupta, Naomi Nishimura. Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. In Claude Puech, Rüdiger Reischuk, editors, STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings. Volume 1046 of Lecture Notes in Computer Science, pages 453-464, Springer, 1996.
@inproceedings{GuptaN96:0,
title = {Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width},
author = {Arvind Gupta and Naomi Nishimura},
year = {1996},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/GuptaN96%3A0},
cites = {0},
citedby = {0},
pages = {453-464},
booktitle = {STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings},
editor = {Claude Puech and Rüdiger Reischuk},
volume = {1046},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-60922-9},
}