A probabilistic upper bound for the edge identification complexity of graphs

Eberhard Triesch. A probabilistic upper bound for the edge identification complexity of graphs. Discrete Mathematics, 125(1-3):371-376, 1994. [doi]

Abstract

Abstract is missing.