All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
From MaRDI portal
Publication:400494
DOI10.1016/j.dam.2014.03.014zbMath1298.05061OpenAlexW1989628911MaRDI QIDQ400494
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
treecomplete bipartite graphall-to-all broadcastall-to-all broadcast numberbroadcasting setdouble loop network
Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Broadcasting multiple messages in the 1-in port model in optimal time, Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model, All-to-all broadcast problems on Cartesian product graphs, Modelling simultaneous broadcasting by level-disjoint partitions
Cites Work
- Unnamed Item
- 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
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- 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
