Takashi Yamada, Takayoshi Shoudai. Efficient Pattern Matching on Graph Patterns of Bounded Treewidth. Electronic Notes in Discrete Mathematics, 37:117-122, 2011. [doi]
@article{YamadaS11-0,
title = {Efficient Pattern Matching on Graph Patterns of Bounded Treewidth},
author = {Takashi Yamada and Takayoshi Shoudai},
year = {2011},
doi = {10.1016/j.endm.2011.05.021},
url = {http://dx.doi.org/10.1016/j.endm.2011.05.021},
tags = {graph-rewriting, pattern matching, rewriting},
researchr = {https://researchr.org/publication/YamadaS11-0},
cites = {0},
citedby = {0},
journal = {Electronic Notes in Discrete Mathematics},
volume = {37},
pages = {117-122},
}