Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees (Q4537606)
From MaRDI portal
!
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 1761997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees |
scientific article; zbMATH DE number 1761997 |
Statements
Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees (English)
0 references
1 July 2002
0 references
communication network
0 references
line broadcasting
0 references
complete binary trees
0 references
0.8505659699440002
0 references
0.8449267745018005
0 references
0.8390416502952576
0 references
0.8294396996498108
0 references
