Minimum \(k\)-broadcast graphs

DOI10.1016/0166-218X(94)90185-6zbMath0807.94030OpenAlexW2075209307MaRDI QIDQ1339891

Emmanuel Lazard, Jean-Claude Konig

Publication date: 11 December 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90185-6

zbMATH Keywords

communication networkbroadcasting\(k\)-broadcast graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15)

Related Items (8)

Binary linear programming models for robust broadcasting in communication networks ⋮ Methods and problems of communication in usual networks ⋮ A new construction of broadcast graphs ⋮ Improved upper and lower bounds fork-broadcasting ⋮ An algorithm for constructing minimalc-broadcast networks ⋮ k-Broadcasting in trees ⋮ A New Construction of Broadcast Graphs ⋮ Broadcasting in weighted trees under the postal model

Cites Work

• Sparse broadcast graphs
• Broadcasting in DMA-bound bounded degree graphs
• Minimum broadcast digraphs
• Minimum broadcast graphs
• Some minimum broadcast graphs
• A survey of gossiping and broadcasting in communication networks
• Minimal broadcast networks
• Tight Bounds on Mimimum Broadcast Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum \(k\)-broadcast graphs