Broadcasting in Trees with Multiple Originators

DOI10.1137/0602040MaRDI QIDQ3950477zbMATH OpenOpenAlexFDO

Authors Arthur M. Farley, Andrzej Proskurowski

Publication date 1981

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0602040

zbMATH Keywords

subtreestree networkinformation dissemination process in a communication network

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Broadcast Time in Communication Networks
• Information Dissemination in Trees
• Minimal broadcast networks
• Minimum broadcast graphs
• Partitioning trees: Matching, domination, and maximum diameter

Cited in

(10)

• Broadcasting in weighted trees under the postal model
• Upper bounds and approximation results for the \(k\)-slow burning problem
• The minimum broadcast time problem for several processor networks
• The multiple originator broadcasting problem in graphs
• Finding broadcast 2-centers of a tree under the postal model
• All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
• Broadcasting from multiple originators
• All-to-all broadcast problems on Cartesian product graphs
• Minimum multiple originator broadcast graphs
• Extremal broadcasting problems

This page was built for publication: Broadcasting in Trees with Multiple Originators

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