Publication:4038748
From MaRDI portal
zbMath0767.94028arXivmath/9504212MaRDI QIDQ4038748
Michael J. Dinneen, Michael R. Fellows, Vance Faber
Publication date: 18 May 1993
Full work available at URL: https://arxiv.org/abs/math/9504212
hypercubes; dihedral groups; broadcast networks; broadcast diameter; Cayley graph techniques; maximum node degree
94C15: Applications of graph theory to circuits and networks
Related Items
Some minimum gossip graphs, Sparse broadcast graphs, Compound constructions of broadcast networks, Graph theoretical issues in computer networks, Reliable broadcasting, A minimum broadcast graph on 63 vertices, Time-relaxed broadcasting in communication networks, Lower bounds for the size in four families of minimum broadcast graphs, Bounded depth broadcasting, More broadcast graphs