On the number of broadcast schemes in networks

DOI10.1016/J.IPL.2006.06.007MaRDI QIDQ845865zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 975322
• Broadcast Networks of Bounded Degree
• scientific article; zbMATH DE number 6469246
• On the construction of minimal broadcast networks
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Broadcasting in butterfly and deBruijn networks
• Broadcasting in butterfly and deBruijn networks (extended abstract)
• Randomized broadcast in networks
• An efficient heuristic for broadcasting in networks

Cites work

• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 1256746 (Why is no real title available?)
• scientific article; zbMATH DE number 2079323 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 1875435 (Why is no real title available?)
• scientific article; zbMATH DE number 857072 (Why is no real title available?)
• A minimum broadcast graph on 63 vertices
• A survey of gossiping and broadcasting in communication networks
• Antepenultimate broadcasting
• Approximation Algorithms for Minimum-Time Broadcast
• Hierarchical broadcast networks
• Information Dissemination in Trees
• Lower bounds for the size in four families of minimum broadcast graphs
• Methods and problems of communication in usual networks
• Minimal broadcast networks
• More broadcast graphs
• Parallel algorithms for gossiping by mail
• Randomized broadcast in networks
• Sparse broadcast graphs
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• The number of homeomorphically irreducible trees, and other species
• Unranking and ranking spanning trees of a graph

Cited in

(7)

• scientific article; zbMATH DE number 6469246 (Why is no real title available?)
• Some properties of the Knödel graph W(k,2ᵏ), k 4
• Locating Number of Biswapped Networks
• On the monotonicity of the broadcast function
• A general broadcasting scheme for recursive networks with complete connection
• scientific article; zbMATH DE number 4145830 (Why is no real title available?)
• The do-all problem in broadcast networks

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

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