Broadcasting in Trees with Multiple Originators

DOI10.1137/0602040zbMATH Open0488.94044OpenAlexW1992847581MaRDI QIDQ3950477FDOQ3950477

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

• Title not available (Why is that?)
• Minimum broadcast graphs
• Minimal broadcast networks
• Information Dissemination in Trees
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Partitioning trees: Matching, domination, and maximum diameter
• Broadcast Time in Communication Networks

Cited In (10)

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

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)