Christopher Lynch, Polina Strogova. SOUR graphs for efficient completion. Discrete Mathematics & Theoretical Computer Science, 2(1):1-25, 1998. [doi]
@article{LynchS98:0,
title = {SOUR graphs for efficient completion},
author = {Christopher Lynch and Polina Strogova},
year = {1998},
url = {http://dmtcs.loria.fr/volumes/abstracts/dm020101.abs.html},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/LynchS98%3A0},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics & Theoretical Computer Science},
volume = {2},
number = {1},
pages = {1-25},
}