Minimum multiple message broadcast graphs

DOI10.1002/NET.20110zbMATH Open1102.68094OpenAlexW4232461472MaRDI QIDQ5487809FDOQ5487809

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

Recommendations

• Multiple message broadcasting in communication networks
• Minimum \(k\)-broadcast graphs
• Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
• Minimum multiple originator broadcast graphs
• Tight Bounds on Mimimum Broadcast Networks

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)

Cited In (15)

• All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
• The shortest path problem in the Knödel graph
• Upper bounds on the broadcast function using minimum dominating sets
• Title not available (Why is that?)
• Minimum \(k\)-broadcast graphs
• Modelling simultaneous broadcasting by level-disjoint partitions
• On the construction of regular minimal broadcast digraphs
• All-to-all broadcast problems on Cartesian product graphs
• Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model
• On broadcast schemes of Knödel graphs
• Broadcasting multiple messages in the 1-in port model in optimal time
• Multi-messages broadcasting in simultaneously send/receive communication networks
• Total domination in cubic Knodel graphs
• Title not available (Why is that?)
• On equitable colouring of Knödel graphs

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

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