Sparse hypercube -- a minimal \(k\)-line broadcast graph.

DOI10.1016/S0166-218X(02)00244-5zbMath1057.68078MaRDI QIDQ1811066

Arthur M. Farley, Satoshi Fujita

Publication date: 10 June 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

\(k\)-line communicationMinimal broadcast graphSparse hypercube

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse broadcast graphs
• Minimum broadcast graphs
• Compound constructions of broadcast networks
• Methods and problems of communication in usual networks
• More broadcast graphs
• Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs
• A survey of gossiping and broadcasting in communication networks
• On the construction of minimal broadcast networks
• Minimal broadcast networks
• Minimum-time line broadcast networks
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• Multiple message broadcasting in communication networks
• Antepenultimate broadcasting
• The twisted N-cube with application to multiprocessing