A tight upper bound on acquaintance time of graphs (Q343701)
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 6657135
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight upper bound on acquaintance time of graphs |
scientific article; zbMATH DE number 6657135 |
Statements
A tight upper bound on acquaintance time of graphs (English)
0 references
29 November 2016
0 references
acquaintance time of graph
0 references
0.9222831
0 references
0 references
0.8990294
0 references
0.87833446
0 references
0.8653412
0 references
0.8620893
0 references
0.8569837
0 references
0.8560428
0 references
0.8525214
0 references
