Minimum average broadcast time in a graph of bounded degree. (Q2716013)
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: Minimum average broadcast time in a graph of bounded degree. |
scientific article; zbMATH DE number 1600979
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum average broadcast time in a graph of bounded degree. |
scientific article; zbMATH DE number 1600979 |
Statements
20 July 2005
0 references
average broadcast time
0 references
maximum degree
0 references
Minimum average broadcast time in a graph of bounded degree. (English)
0 references
The paper studies the average broadcast time in bounded degree graphs. A lower bound of this time is presented under the assumption that the number of vertices informed each time unit is maximized.
0 references
0.8857335448265076
0 references
0.8675087094306946
0 references
0.8356174826622009
0 references