Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model

DOI10.1007/978-3-319-48749-6_11zbMath1483.68257OpenAlexW2541931949MaRDI QIDQ2958310

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

Publication date: 1 February 2017

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_11

zbMATH Keywords

hypercubetorusmeshlevel-disjoint partitionssimultaneous broadcastingmultiple-message broadcasting

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Broadcasting multiple messages in the 1-in port model in optimal time ⋮ Modelling simultaneous broadcasting by level-disjoint partitions

Cites Work

• Unnamed Item
• All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
• 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
• On the mutually independent Hamiltonian cycles in faulty hypercubes
• Diametral broadcast graphs
• 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: Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model