New lower bounds on broadcast function

DOI10.1007/978-3-319-07956-1_16MaRDI QIDQ5251643zbMATH OpenOpenAlexFDO

Authors Hovhannes A. Harutyunyan, Hayk Grigoryan

Publication date 20 May 2015

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-07956-1_16

zbMATH Keywords

broadcastingminimum broadcast graphsbroadcast functionlower bounds on broadcast function

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• Tight lower bounds on broadcast function for n = 24 and 25
• Improved lower bound on broadcast function based on graph partition
• Upper bounds on the broadcast function using minimum dominating sets
• Lower bounds for the size in four families of minimum broadcast graphs
• Efficient construction of broadcast graphs

Cited in

(11)

• Binary linear programming models for robust broadcasting in communication networks
• Tight lower bounds on broadcast function for n = 24 and 25
• Upper bounds on the broadcast function using minimum dominating sets
• A new construction of broadcast graphs
• Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
• Improved lower bound on broadcast function based on graph partition
• On the monotonicity of the broadcast function
• The complexity of finding a broadcast center
• A new construction of broadcast graphs
• Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
• Minimum multiple originator broadcast graphs

This page was built for publication: New lower bounds on broadcast function

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