A probabilistic upper bound for the edge identification complexity of graphs (Q1322293)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A probabilistic upper bound for the edge identification complexity of graphs |
scientific article |
Statements
A probabilistic upper bound for the edge identification complexity of graphs (English)
0 references
5 May 1994
0 references
edge identification complexity
0 references
random graph
0 references
