All-to-all broadcast problem of some classes of graphs under the half duplex all-port model

DOI10.1016/J.DAM.2014.03.014zbMATH Open1298.05061OpenAlexW1989628911MaRDI QIDQ400494FDOQ400494

Authors: Fei-Huang Chang, Young-Ming Chen, Ma-Lian Chia, David Kuo, Ming-fen Yu 

Publication date: 22 August 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2014.03.014

Recommendations

• All-to-all broadcast problems on Cartesian product graphs
• Methods and problems of communication in usual networks
• All-port line broadcasting in highly connected graphs
• Broadcast and gossip in line-communication mode
• Reliable broadcasting in double loop networks

zbMATH Keywords

treecomplete bipartite graphall-to-all broadcastall-to-all broadcast numberbroadcasting setdouble loop network

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites Work

• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• 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
• Title not available (Why is that?)
• 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
• 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 (6)

• All-port line broadcasting in highly connected graphs
• Time-optimal broadcasting of multiple messages in 1-in port model
• Modelling simultaneous broadcasting by level-disjoint partitions
• All-to-all broadcast problems on Cartesian product graphs
• Broadcasting multiple messages in the 1-in port model in optimal time
• The do-all problem in broadcast networks

This page was built for publication: All-to-all broadcast problem of some classes of graphs under the half duplex all-port model

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