Atsuko Yamaguchi, Kiyoko F. Aoki, Hiroshi Mamitsuka. Finding the maximum common subgraph of a partial ::::k::::-tree and a graph with a polynomially bounded number of spanning trees. Inf. Process. Lett., 92(2):57-63, 2004. [doi]
@article{YamaguchiAM04,
title = {Finding the maximum common subgraph of a partial ::::k::::-tree and a graph with a polynomially bounded number of spanning trees},
author = {Atsuko Yamaguchi and Kiyoko F. Aoki and Hiroshi Mamitsuka},
year = {2004},
doi = {10.1016/j.ipl.2004.06.019},
url = {http://dx.doi.org/10.1016/j.ipl.2004.06.019},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/YamaguchiAM04},
cites = {0},
citedby = {0},
journal = {Inf. Process. Lett.},
volume = {92},
number = {2},
pages = {57-63},
}