Minimum multiple message broadcast graphs

DOI10.1002/net.20110zbMath1102.68094OpenAlexW4232461472MaRDI QIDQ5487809

Hovhannes A. Harutyunyan

Publication date: 12 September 2006

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20110

zbMATH Keywords

broadcastingmultiple message broadcasting\(m\)-message minimum broadcast graphs

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 (10)

Unnamed Item ⋮ Broadcasting multiple messages in the 1-in port model in optimal time ⋮ On equitable colouring of Knödel graphs ⋮ All-to-all broadcast problem of some classes of graphs under the half duplex all-port model ⋮ Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model ⋮ All-to-all broadcast problems on Cartesian product graphs ⋮ Upper bounds on the broadcast function using minimum dominating sets ⋮ The shortest path problem in the Knödel graph ⋮ Modelling simultaneous broadcasting by level-disjoint partitions ⋮ Total domination in cubic Knodel graphs

Cites Work

• Unnamed Item

This page was built for publication: Minimum multiple message broadcast graphs