All-to-all broadcast problems on Cartesian product graphs

DOI10.1016/J.TCS.2015.10.002zbMATH Open1331.68151OpenAlexW2190026022MaRDI QIDQ897889FDOQ897889

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

Recommendations

• All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
• Broadcast domination of products of graphs
• Dominating broadcast labeling in Cartesian products of graphs
• Broadcast domination in graph products of paths
• A broadcasting algorithm on the arrangement graph
• Graph-Theoretic Concepts in Computer Science
• The multiple originator broadcasting problem in graphs
• All-port line broadcasting in highly connected graphs
• The complexity of broadcasting in planar and decomposable graphs
• The complexity of broadcasting in planar and decomposable graphs

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)

Cites Work

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

Cited In (2)

• Modelling simultaneous broadcasting by level-disjoint partitions
• The do-all problem in broadcast networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897889)