Broadcasting multiple messages in the 1-in port model in optimal time

DOI10.1007/s10878-018-0274-xzbMath1414.90346OpenAlexW2794333519MaRDI QIDQ1631684

Vida Vukašinović, Riste Škrekovski, Petr Gregor

Publication date: 6 December 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-0274-x

zbMATH Keywords

hypercubetorusmeshcirculant graphKnödel graphlevel-disjoint partitionsmultiple message broadcastingsimultaneous broadcasting

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Unnamed Item
• Unnamed Item
• All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
• Rooted level-disjoint partitions of Cartesian products
• New gossips and telephones
• A survey on Knödel graphs.
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• Optimal multiple message broadcasting in telephone-like communication systems
• Modelling simultaneous broadcasting by level-disjoint partitions
• On the mutually independent Hamiltonian cycles in faulty hypercubes
• Diametral broadcast graphs
• Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs
• Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model
• Perfect Pipelining for Streaming Large File in Peer-to-Peer Networks
• A survey of gossiping and broadcasting in communication networks
• Broadcast Time in Communication Networks
• Minimum multiple message broadcast graphs

This page was built for publication: Broadcasting multiple messages in the 1-in port model in optimal time