A probabilistic upper bound for the edge identification complexity of graphs.

Eberhard Triesch A probabilistic upper bound for the edge identification complexity of graphs. 371-376 1994 125 Discrete Mathematics 1-3 http://dx.doi.org/10.1016/0012-365X(94)90178-3 db/journals/dm/dm125.html#Triesch94