All-to-all broadcast problems on Cartesian product graphs

DOI10.1016/j.tcs.2015.10.002zbMath1331.68151OpenAlexW2190026022MaRDI QIDQ897889

N. E. Zubov

Publication date: 8 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.10.002

zbMATH Keywords

hypercubecycleCartesian productcomplete graphall-to-all broadcastbroadcasting setall-to-all broadcasting number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Modelling simultaneous broadcasting by level-disjoint partitions

Cites Work

• All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
• All-to-all personalized exchange in generalized shuffle-exchange networks
• Broadcasting from multiple originators
• Methods and problems of communication in usual networks
• Line broadcasting in cycles
• All-to-all personalized communication on multistage interconnection networks
• On the monotonicity of the broadcast function
• Optimal multiple message broadcasting in telephone-like communication systems
• The multiple originator broadcasting problem in graphs
• Optimal all-to-all personalized exchange in \(d\)-nary banyan multistage interconnection networks
• Improved upper and lower bounds fork-broadcasting
• k-Broadcasting in trees
• A survey of gossiping and broadcasting in communication networks
• Broadcast Time in Communication Networks
• Broadcasting in Trees with Multiple Originators
• A linear algorithm for finding the k‐broadcast center of a tree
• Minimal-Time k-Line Broadcasting
• Minimum multiple message broadcast graphs

This page was built for publication: All-to-all broadcast problems on Cartesian product graphs