A probabilistic upper bound for the edge identification complexity of graphs (Q1322293)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A probabilistic upper bound for the edge identification complexity of graphs |
scientific article; zbMATH DE number 562681
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A probabilistic upper bound for the edge identification complexity of graphs |
scientific article; zbMATH DE number 562681 |
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
0.88546777
0 references
0.8840834
0 references
0.8822707
0 references
0.87796324
0 references
0.8779216
0 references
0.87698066
0 references
0.86933595
0 references
0.86933595
0 references
