A probabilistic upper bound for the edge identification complexity of graphs (Q1322293): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:21, 31 January 2024
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
