On the number of broadcast schemes in networks

DOI10.1016/j.ipl.2006.06.007zbMath1185.68043OpenAlexW2012019295MaRDI QIDQ845865

Calin D. Morosan

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.06.007

zbMATH Keywords

interconnection networksminimum broadcast timenumber of broadcast schemesrandomly broadcasting

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hierarchical broadcast networks
• The number of homeomorphically irreducible trees, and other species
• Parallel algorithms for gossiping by mail
• Sparse broadcast graphs
• Methods and problems of communication in usual networks
• A minimum broadcast graph on 63 vertices
• Lower bounds for the size in four families of minimum broadcast graphs
• More broadcast graphs
• Randomized broadcast in networks
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• A survey of gossiping and broadcasting in communication networks
• Minimal broadcast networks
• Information Dissemination in Trees
• Unranking and ranking spanning trees of a graph
• Approximation Algorithms for Minimum-Time Broadcast
• Antepenultimate broadcasting

This page was built for publication: On the number of broadcast schemes in networks