Minimum broadcast tree decompositions

DOI10.1016/j.disc.2008.03.016zbMath1209.05218OpenAlexW2079462730MaRDI QIDQ1025538

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

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

Cites Work

• Unnamed Item
• Some small sized spanning subgraphs of a hypercube
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• A study of minimum gossip graphs
• On Graceful Directed Graphs