Broadcast Schemes of Hypercubes
Broadcasting is a fundamental process in network communication, modeled as the dissemination of information across vertices in a graph. This paper investigates the broadcast problem in hypercube graphs and revisits the dimensional broadcast schemes. We propose a novel algorithm that generates all va...
Uloženo v:
| Vydáno v: | Journal of graph algorithms and applications Ročník 29; číslo 1; s. 125 - 134 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
16.06.2025
|
| ISSN: | 1526-1719, 1526-1719 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | Broadcasting is a fundamental process in network communication, modeled as the dissemination of information across vertices in a graph. This paper investigates the broadcast problem in hypercube graphs and revisits the dimensional broadcast schemes. We propose a novel algorithm that generates all valid minimum-time broadcast schemes by using the recursive structure of hypercubes. Additionally, we compute the total number of valid minimum-time broadcast schemes in hypercubes, which is also the number of all spanning binomial trees. We also give an enumeration of all valid minimum-time broadcast schemes. |
|---|---|
| ISSN: | 1526-1719 1526-1719 |
| DOI: | 10.7155/jgaa.v29i1.3011 |