A probabilistic upper bound for the edge identification complexity of graphs
Discrete Math. 125 (1994), no. 1-3, 371--376.
BibTex references
@Article\{Tri94a,
author = "Triesch, Eberhard",
title = "A probabilistic upper bound for the edge identification complexity of graphs",
journal = "Discrete Math.",
number = "1-3",
volume = "125",
pages = "371--376",
year = "1994",
}