Minimum broadcast tree decompositions

DOI10.1016/J.DISC.2008.03.016MaRDI QIDQ1025538zbMATH OpenOpenAlexFDO

Authors Matt Walsh

Publication date 19 June 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2008.03.016

zbMATH Keywords

graph decompositionminimum broadcast tree

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Communication networks in operations research (90B18)

Recommendations

• Minimum broadcast digraphs
• On the structure of minimum broadcast digraphs
• Tight Bounds on Mimimum Broadcast Networks
• scientific article; zbMATH DE number 4141826
• scientific article; zbMATH DE number 1743971

Cites work

• scientific article; zbMATH DE number 1096962 (Why is no real title available?)
• A study of minimum gossip graphs
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• On Graceful Directed Graphs
• Some small sized spanning subgraphs of a hypercube

Cited in

(3)

• Minimizing broadcast costs under edge reductions in tree networks
• Directed complete bipartite graph decompositions: indirect constructions
• The shared broadcast tree problem and MST

This page was built for publication: Minimum broadcast tree decompositions

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