Acquaintance time of random graphs near connectivity threshold (Q2801332)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6563977
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Acquaintance time of random graphs near connectivity threshold |
scientific article; zbMATH DE number 6563977 |
Statements
7 April 2016
0 references
random graphs
0 references
vertex-pursuit games
0 references
acquaintance time
0 references
Acquaintance time of random graphs near connectivity threshold (English)
0 references
0.9153615236282348
0 references
0.8249173760414124
0 references
0.8028749227523804
0 references
0.7860499024391174
0 references
0.7498512864112854
0 references
