Fred W. DePiero. Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort. In ICPR (4). pages 379-382, 2004. [doi]
@inproceedings{DePiero04,
title = {Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort},
author = {Fred W. DePiero},
year = {2004},
doi = {10.1109/ICPR.2004.867},
url = {http://doi.ieeecomputersociety.org/10.1109/ICPR.2004.867},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/DePiero04},
cites = {0},
citedby = {0},
pages = {379-382},
booktitle = {ICPR (4)},
}