Generalized de Bruijn digraphs
Networks
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Broadcasting and Gossiping in de Bruijn Networks
SIAM Journal on Computing
Broadcasting on recursively decomposable Cayley graphs
Proceedings of the international workshop on Broadcasting and gossiping 1990
A fault-tolerant broadcasting algorithm for hypercubes
Information Processing Letters
Broadcasting in unlabeled hypercubes with a linear number of messages
Information Processing Letters
Design to Minimize Diameter on Building-Block Network
IEEE Transactions on Computers
A Design for Directed Graphs with Minimum Diameter
IEEE Transactions on Computers
| Hi-index | 0.00 |
This work deals with a broadcasting on generalized de Bruijn digraphs. Broadcasting on digraphs corresponds to one on networks with monodirection communication links in practice. The efficiency of broadcasting is affected by network topology. Generalized de Bruijn digraph is one of useful network models. We propose protocols for broadcasting on generalized de Bruijn digraphs using Kronecker product of graphs. The protocol presented in this paper constructs a k-ramified tree.