Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Eberhard Triesch. A probabilistic upper bound for the edge identification complexity of graphs. Discrete Mathematics, 125(1-3):371-376, 1994. [doi]
No references recorded for this publication.
No citations of this publication recorded.