Eberhard Triesch. A probabilistic upper bound for the edge identification complexity of graphs. Discrete Mathematics, 125(1-3):371-376, 1994. [doi]
@article{Triesch94,
title = {A probabilistic upper bound for the edge identification complexity of graphs},
author = {Eberhard Triesch},
year = {1994},
doi = {10.1016/0012-365X(94)90178-3},
url = {http://dx.doi.org/10.1016/0012-365X(94)90178-3},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Triesch94},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics},
volume = {125},
number = {1-3},
pages = {371-376},
}