Extremal broadcasting problems

DOI10.1016/0166-218X(89)90024-3MaRDI QIDQ1120554zbMATH OpenFDO

Authors Roger Labahn

Publication date 1989

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

extremal broadcasting problems on graphs and on trees

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Information Dissemination in Trees
• Broadcasting in Bounded Degree Graphs
• Broadcast Networks of Bounded Degree
• Lower bounds for the size in four families of minimum broadcast graphs
• Bounded depth broadcasting

Cites work

• scientific article; zbMATH DE number 3910097 (Why is no real title available?)
• scientific article; zbMATH DE number 3979062 (Why is no real title available?)
• scientific article; zbMATH DE number 3979080 (Why is no real title available?)
• scientific article; zbMATH DE number 4059410 (Why is no real title available?)
• scientific article; zbMATH DE number 3666695 (Why is no real title available?)
• scientific article; zbMATH DE number 3666856 (Why is no real title available?)
• scientific article; zbMATH DE number 3702701 (Why is no real title available?)
• scientific article; zbMATH DE number 3706373 (Why is no real title available?)
• Broadcast Time in Communication Networks
• Broadcasting in Trees with Multiple Originators
• Information Dissemination in Trees
• Minimal broadcast networks
• Minimum broadcast graphs
• On a unimodal sequence of binomial coefficients

Cited in

(16)

• Parameterized complexity of broadcasting in graphs
• Broadcasting in heterogeneous tree networks with uncertainty
• On linear-time data dissemination in dynamic rooted trees
• Local broadcasting in a tree under minisum criterion
• Nondiscriminatory propagation on trees
• Broadcast problem in hypercube of trees
• Nonadaptive broadcasting in trees
• Line-broadcasting in complete \(k\)-ary trees
• Broadcast Extensions with Optimal Communication and Round Complexity
• \(k\)-broadcasting in trees
• Broadcasting in general networks I: Trees
• Broadcasting in Sierpinski gasket graphs
• Set to set broadcasting in communication networks
• Information Dissemination in Trees
• Efficient broadcast trees for weighted vertices
• On broadcasting in unicyclic graphs

This page was built for publication: Extremal broadcasting problems

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